Glosbe

Besonderhede van voorbeeld: 4194490063402877900

Metadata

Data

English[en]
(Redirected from Proof that Boolean satisfiability problem is NP-complete)
Spanish[es]
El Problema de satisfacibilidad booleana (SAT) es NP-completo.

History

Your action: