Propositional proofs and reductions between NP search problems (Q435190): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The relative complexity of NP search problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential separation between the parity principle and the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separation results for the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Corrected upper bounds for free-cut elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof complexity in algebraic systems and bounded depth Frege systems with modular counting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight relationship between generic oracles and type-2 complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing a Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: Herbrandizing search problems in Bounded Arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On total functions, existence theorems and computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank

Latest revision as of 10:33, 5 July 2024

scientific article
Language Label Description Also known as
English
Propositional proofs and reductions between NP search problems
scientific article

    Statements

    Propositional proofs and reductions between NP search problems (English)
    0 references
    0 references
    0 references
    11 July 2012
    0 references
    search problems
    0 references
    Nullstellensatz
    0 references
    propositional proofs
    0 references
    polynomial-time reducibility
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references