Pages that link to "Item:Q2475405"

The following pages link to A combinatorial characterization of resolution width (Q2475405):

Displaying 37 items.

• Cutting planes and the parameter cutwidth (Q693047) (← links)
• A simplified way of proving trade-off results for resolution (Q989569) (← links)
• A combinatorial characterization of treelike resolution space (Q1014444) (← links)
• On space and depth in resolution (Q1616620) (← links)
• A note about \(k\)-DNF resolution (Q1641156) (← links)
• A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
• The complexity of proving that a graph is Ramsey (Q1705815) (← links)
• Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
• On semantic cutting planes with very small coefficients (Q1751424) (← links)
• On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
• The treewidth of proofs (Q2013559) (← links)
• Space proof complexity for random 3-CNFs (Q2013560) (← links)
• Partially definable forcing and bounded arithmetic (Q2257103) (← links)
• Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
• On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
• A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
• A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
• A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
• Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
• Total Space in Resolution (Q2829448) (← links)
• Space Complexity in Polynomial Calculus (Q2944568) (← links)
• Lower Bound Techniques for QBF Proof Systems (Q3304096) (← links)
• Resolution Width and Cutting Plane Rank Are Incomparable (Q3599159) (← links)
• Proof Complexity Meets Algebra (Q4617977) (← links)
• (Q4625692) (← links)
• (Q4989407) (← links)
• Definable Inapproximability: New Challenges for Duplicator (Q5079727) (← links)
• Short Proofs Are Hard to Find (Q5091243) (← links)
• Super strong ETH is true for PPSZ with small resolution width (Q5092450) (← links)
• (Q5140848) (← links)
• Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
• From Small Space to Small Width in Resolution (Q5277893) (← links)
• Narrow Proofs May Be Maximally Long (Q5277920) (← links)
• Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution (Q5902141) (← links)
• Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
• Proof complexity and the binary encoding of combinatorial principles (Q6562831) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)