Total nondeterministic Turing machines and a p-optimal proof system for SAT (Q2011675)

From MaRDI portal
Revision as of 06:05, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Total nondeterministic Turing machines and a p-optimal proof system for SAT
scientific article

    Statements

    Total nondeterministic Turing machines and a p-optimal proof system for SAT (English)
    0 references
    0 references
    4 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    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