Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (Q2500481): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The independence of the modulo <i>p</i> counting principles / rank
 
Normal rank
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: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hex Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size proofs of the propositional pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting planes, connectivity, and threshold logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear gaps between degrees for the polynomial calculus modulo distinct primes / 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: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Game of Hex and the Brouwer Fixed-Point Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135772 / 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
Property / cites work
 
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank

Latest revision as of 19:20, 24 June 2024

scientific article
Language Label Description Also known as
English
Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies
scientific article

    Statements

    Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies (English)
    0 references
    0 references
    16 August 2006
    0 references
    0 references
    propositional logic
    0 references
    resolution
    0 references
    proof complexity
    0 references
    graph connectivity
    0 references
    Hex game
    0 references
    0 references