Pages that link to "Item:Q5047172"
From MaRDI portal
The following pages link to On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q5047172):
Displaying 7 items.
- Parity OBDDs cannot be handled efficiently enough (Q293348) (← links)
- Algebraic proofs over noncommutative formulas (Q642520) (← links)
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams (Q1293553) (← links)
- Decision procedures for inductive Boolean functions based on alternating automata (Q1399969) (← links)
- Linear codes are hard for oblivious read-once parity branching programs (Q1606909) (← links)
- Lower bounds for linearly transformed OBDDs and FBDDs (Q1608325) (← links)
- On the descriptive and algorithmic power of parity ordered binary decision diagrams (Q1854421) (← links)