Pages that link to "Item:Q2706120"
From MaRDI portal
The following pages link to On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (Q2706120):
Displayed 23 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)
- Proof complexity of modal resolution (Q832717) (← 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)
- 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)
- The state of SAT (Q2643296) (← links)
- A Tutorial on Time and Space Bounds in Tree-Like Resolution (Q2821700) (← links)
- Deterministic Communication vs. Partition Number (Q4562279) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- (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)
- Circular (Yet Sound) Proofs in Propositional Logic (Q6116357) (← links)