Pages that link to "Item:Q5387310"
From MaRDI portal
The following pages link to An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams (Q5387310):
Displayed 12 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- A note on SAT algorithms and proof complexity (Q436581) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Resolution over linear equations and multilinear proofs (Q952492) (← links)
- A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
- The complexity of the Hajós calculus for planar graphs (Q2268877) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Dag-like communication and its applications (Q2399382) (← links)
- A form of feasible interpolation for constant depth Frege systems (Q3570172) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- (Q5121904) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)