Resolution with counting: dag-like lower bounds and different moduli (Q2029775): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3119890049 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering the cube by affine hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for the bounded depth Frege proof system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / 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: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / 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: Proof Complexity Lower Bounds from Algebraic Circuit Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Subsystems of Constant-Depth Frege with Parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit Complexity, Proof Complexity, and Polynomial Identity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution over linear equations modulo two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretely ordered modules as a first-order extension of the cutting planes proof system / rank
 
Normal rank
Property / cites work
 
Property / cites work: A feasible interpolation for random resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monotone circuits with local oracles and clique lower bounds / 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: Essential covers of the cube by hyperplanes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramanujan graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952609 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution over linear equations and multilinear proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank

Latest revision as of 21:21, 25 July 2024

scientific article
Language Label Description Also known as
English
Resolution with counting: dag-like lower bounds and different moduli
scientific article

    Statements

    Resolution with counting: dag-like lower bounds and different moduli (English)
    0 references
    0 references
    0 references
    4 June 2021
    0 references
    proof complexity
    0 references
    lower bounds
    0 references
    resolution
    0 references
    resolution over linear equations
    0 references
    polynomial calculus
    0 references
    linear decision trees
    0 references
    propositional pigeonhole principle
    0 references
    tseitin formulas
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references