Cook–Levin theorem (Q377276)

From Wikidata
Jump to: navigation, search
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
  • Cook's theorem
edit
Language Label Description Also known as
English
Cook–Levin theorem
Theorem that Boolean satisfiability is NP-complete and therefore that NP-complete problems exist
  • Cook's theorem

Statements

0 references
0 references

Identifiers

 
edit
    edit
      edit
        edit
          edit
            edit
              edit