Pages that link to "Item:Q558312"

The following pages link to Near optimal seperation of tree-like and general resolution (Q558312):

Displaying 26 items.

• The depth of resolution proofs (Q647405) (← links)
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
• Finding a tree structure in a resolution proof is NP-complete (Q1019749) (← 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)
• Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
• On semantic cutting planes with very small coefficients (Q1751424) (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
• Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
• Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
• A proof builder for Max-SAT (Q2118341) (← links)
• Resolution over linear equations modulo two (Q2334112) (← links)
• A characterization of tree-like resolution size (Q2444907) (← links)
• Typical case complexity of satisfiability algorithms and the threshold phenomenon (Q2581549) (← links)
• The state of SAT (Q2643296) (← links)
• Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
• A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
• Regular and General Resolution: An Improved Separation (Q3502715) (← links)
• An Exponential Lower Bound for Width-Restricted Clause Learning (Q3637163) (← links)
• (Q4989407) (← links)
• (Q4993273) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Proofs and Certificates for Max-SAT (Q5870516) (← links)
• MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
• On (simple) decision tree rank (Q6050134) (← links)
• Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)