Reflections on Proof Complexity and Counting Principles (Q5027248): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the power and limitations of branch and cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators hard for \(k\)-DNF resolution and polynomial calculus resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Resolution Versus Unrestricted Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Davis-Putnam resolution versus unrestricted resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cops-robber games and the resolution of Tseitin formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4993273 / 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: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and Small-Depth Frege Proofs / 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: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many hard examples for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / 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: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A machine program for theorem-proving / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semialgebraic Proofs and Efficient Algorithm Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Explicit constructions of linear-sized superconcentrators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of regular resolution and the Davis-Putnam procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone circuit lower bounds from resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension Complexity of Independent Set Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication lower bounds via critical block sensitivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Average-Case Depth Hierarchy Theorem for Boolean Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A DNF without Regular Shortest Consensus Path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / 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: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic Frege depth lower bounds via an expander switching lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone circuits for matching require linear depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution lower bounds for perfect matching principles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dag-like communication and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Separation of Regular and General Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified lower bounds for propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear gaps between degrees for the polynomial calculus modulo distinct primes / rank
 
Normal rank

Latest revision as of 21:51, 27 July 2024

scientific article; zbMATH DE number 7469221
Language Label Description Also known as
English
Reflections on Proof Complexity and Counting Principles
scientific article; zbMATH DE number 7469221

    Statements

    Reflections on Proof Complexity and Counting Principles (English)
    0 references
    0 references
    0 references
    4 February 2022
    0 references
    theory of computation
    0 references
    complexity theory
    0 references
    propositional proof complexity
    0 references
    counting principles
    0 references
    Tseitin tautologies
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers