Short propositional formulas represent nondeterministic computations (Q1096390)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Short propositional formulas represent nondeterministic computations |
scientific article; zbMATH DE number 4030979
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short propositional formulas represent nondeterministic computations |
scientific article; zbMATH DE number 4030979 |
Statements
Short propositional formulas represent nondeterministic computations (English)
0 references
1988
0 references
nondeterministic Turing machine
0 references
conjunctive normal form
0 references
NP-complete
0 references
satisfiability
0 references
