Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675)
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: Total nondeterministic Turing machines and a p-optimal proof system for SAT |
scientific article; zbMATH DE number 6756776
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total nondeterministic Turing machines and a p-optimal proof system for SAT |
scientific article; zbMATH DE number 6756776 |
Statements
Total nondeterministic Turing machines and a p-optimal proof system for SAT (English)
0 references
4 August 2017
0 references
p-optimal proof system for SAT
0 references
optimal propositional proof system
0 references
total Turing machines
0 references
disjoint NP-pairs
0 references
0 references
