Teken aan
Besonderhede van voorbeeld: 8487101800448672243
terug
Metadata
Author:
WikiMatrix
Data
English
[en]
The Cook–Levin theorem states that the Boolean satisfiability problem is NP-complete.
Spanish
[es]
El Teorema de Cook demuestra que el problema de satisfacibilidad booleana es un problema NP-completo.
History
Your action:
Comment
Mark incorrect example
Please enable JavaScript.