On the computational complexity of finding hard tautologies (Q5402611)

From MaRDI portal
Revision as of 22:01, 23 November 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 6270262
Language Label Description Also known as
English
On the computational complexity of finding hard tautologies
scientific article; zbMATH DE number 6270262

    Statements

    On the computational complexity of finding hard tautologies (English)
    0 references
    0 references
    14 March 2014
    0 references
    propositional proof systems
    0 references
    proof complexity
    0 references
    Nisan-Wigderson generator
    0 references

    Identifiers