Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
DOI10.1016/J.IPL.2005.11.011zbMATH Open1187.68247OpenAlexW1964040754MaRDI QIDQ844146FDOQ844146
Authors: Henrik Brosenne, Matthias Homeister, Stephan Waack 
Publication date: 18 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.11.011
Recommendations
- Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams
- An improved hierarchy result for partitioned BDDs
- Publication:4934627
- On the hierarchies for deterministic, nondeterministic and probabilistic ordered read-\(k\)-times branching programs
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs
computational complexitytheory of computationparitybranching programsuniversalexistentialordered binary decision diagrams with repeated tests
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- Branching Programs and Binary Decision Diagrams
- Communication Complexity
- Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
- Rounds in Communication Complexity Revisited
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs
- Title not available (Why is that?)
- On relations between counting communication complexity classes
- Lower bounds for depth-restricted branching programs
- The power of nondeterminism and randomness for oblivious branching programs
- On oblivious branching programs of linear length
- Title not available (Why is that?)
- Meanders and their applications in lower bounds arguments
- Mathematical Foundations of Computer Science 2003
Cited In (3)
This page was built for publication: Nondeterministic ordered binary decision diagrams with repeated tests and various modes of acceptance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844146)
