Short propositional formulas represent nondeterministic computations (Q1096390): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:29, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short propositional formulas represent nondeterministic computations |
scientific article |
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
