Pages that link to "Item:Q1408378"
From MaRDI portal
The following pages link to Resolution and binary decision diagrams cannot simulate each other polynomially (Q1408378):
Displayed 11 items.
- Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200) (← links)
- A direct construction of polynomial-size OBDD proof of pigeon hole problem (Q987797) (← links)
- Binary decision diagrams for first-order predicate logic. (Q1426055) (← links)
- Resolution cannot polynomially simulate compressed-BFS (Q1776193) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Extended resolution simulates binary decision diagrams (Q2478427) (← links)
- (Q5121904) (← links)
- (Q5146113) (← links)
- (Q5146127) (← links)
- ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES (Q5148102) (← links)
- Generating Extended Resolution Proofs with a BDD-Based SAT Solver (Q6082228) (← links)