Pages that link to "Item:Q2706120"

The following pages link to On the relative complexity of resolution refinements and cutting planes proof systems (Q2706120):

Displaying 33 items.

• Relativization makes contradictions harder for resolution (Q386151) (← links)
• The depth of resolution proofs (Q647405) (← links)
• Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
• Proof complexity of modal resolution (Q832717) (← links)
• Exponential separation between Res(\(k\)) and Res(\(k+1\)) for \(k \leqslant \varepsilon\log n\) (Q835026) (← links)
• Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable (Q903199) (← links)
• The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157) (← links)
• On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
• A combinatorial characterization of treelike resolution space (Q1014444) (← links)
• On the automatizability of resolution and related propositional proof systems (Q1881219) (← links)
• On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
• Simulation theorems via pseudo-random properties (Q2281252) (← links)
• Separation results for the size of constant-depth propositional proofs (Q2566064) (← links)
• The state of SAT (Q2643296) (← links)
• A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
• Hardness amplification in proof complexity (Q2875135) (← links)
• Input Proofs and Rank One Cutting Planes (Q4018154) (← links)
• Deterministic Communication vs. Partition Number (Q4562279) (← links)
• (Q4601841) (← links)
• Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
• Stabbing planes (Q4993273) (← links)
• On Exponential Lower Bounds for Partially Ordered Resolution (Q5015597) (← links)
• (Q5088887) (← links)
• Equality alone does not simulate randomness (Q5091765) (← links)
• On CDCL-Based Proof Systems with the Ordered Decision Strategy (Q5097511) (← links)
• (Q5136303) (← links)
• The complexity of resolution refinements (Q5444704) (← links)
• The Complexity of Propositional Proofs (Q5444711) (← links)
• Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
• Classes of hard formulas for QBF resolution (Q6488807) (← links)
• Proof complexity and beyond. Abstracts from the workshop held March 24--29, 2024 (Q6613418) (← links)
• Cutting planes width and the complexity of graph isomorphism refutations (Q6636618) (← links)
• First order Büchi automata and their application to verification of LTL specifications (Q6643476) (← links)