Refine
Document Type
- Article (3)
- Conference Proceeding (2)
Language
- English (5)
Has Fulltext
- no (5)
Is part of the Bibliography
- yes (5)
Keywords
- Computational complexity (2)
- Approximation (1)
- Branching programs (1)
- Existential, universal, parity, and majority acceptance mode (1)
- Nondeterministic OBDD (1)
- Ordered binary decision diagrams with repeated tests (1)
- Parity OBDD (1)
- Theory of computation (1)
- Well-structured graph-driven parity-FBDDs (1)
- complexity theory (1)
- data structures for Boolean functions (1)
- lower bounds (1)
- minimization algorithm (1)
On approximation by ⊕-OBDDs
(2007)