What would the conqesquences of finding a quasi polynomial-time algorithm for 3-Sat?

What would the conqesquences of finding a quasi polynomial-time algorithm for 3-Sat?

Would this result in their being a quasi polynomial-time algorithm for all NP-complete problems?

• What do you think? Have you tried using the definition of NP-completeness? – Yuval Filmus Jun 8 '20 at 13:17