Narrow Proofs May Be Maximally Long (Q5277920): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Mutilated chessboard problem is exponentially hard for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space Complexity in Propositional Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial characterization of resolution width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypercontractivity, sum-of-squares proofs, and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4399249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs in resolution / 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: Some trade-off results for polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Size-Space Tradeoffs for Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space complexity of random formulae in resolution / 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: Parameterized Complexity of DPLL Search Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Bounded-Depth Frege Is not Optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5769706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Space Complexity in Algebraic Proof Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space proof complexity for random 3-CNFs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Space in Resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality of size-width tradeoffs for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polybori: A framework for Gröbner-basis computations with Boolean polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: New developments in the theory of Gröbner bases and applications to formal verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Relaxations and Integrality Gaps / 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: Relativization makes contradictions harder for resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight rank lower bounds for the Sherali-Adams proof system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Resolution with Clauses of Bounded Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5645210 / 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: Q4807964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Null- and Positivstellensatz proofs / 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: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus and the Gröbner basis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4537750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601842 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP: a search algorithm for propositional satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs as Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2816413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard examples for resolution / rank
 
Normal rank

Latest revision as of 02:26, 14 July 2024

scientific article; zbMATH DE number 6744238
Language Label Description Also known as
English
Narrow Proofs May Be Maximally Long
scientific article; zbMATH DE number 6744238

    Statements

    Narrow Proofs May Be Maximally Long (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2017
    0 references
    proof complexity
    0 references
    resolution
    0 references
    width
    0 references
    polynomial calculus
    0 references
    polynomial calculus resolution
    0 references
    PCR
    0 references
    Sherali-Adams
    0 references
    SAR
    0 references
    degree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers