Pages that link to "Item:Q5900286"
From MaRDI portal
The following pages link to Principles and Practice of Constraint Programming – CP 2004 (Q5900286):
Displayed 14 items.
- Towards NP-P via proof complexity and search (Q408544) (← links)
- How to deal with unbelievable assertions (Q524943) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
- On tseitin formulas, read-once branching programs and treewidth (Q2043884) (← links)
- Proof complexity of symbolic QBF reasoning (Q2118330) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
- Characterizing Propositional Proofs as Noncommutative Formulas (Q4577770) (← links)
- Proof Complexity Meets Algebra (Q4617977) (← links)
- (Q5121904) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)