On approximation by ^-OBDDs
From MaRDI portal
Publication:845954
DOI10.1016/J.IPL.2006.10.011zbMATH Open1184.68262OpenAlexW2081050659MaRDI QIDQ845954FDOQ845954
Authors: Henrik Brosenne, Carsten Damm, Matthias Homeister, Stephan Waack 
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2006.10.011
Recommendations
- Mathematical Foundations of Computer Science 2004
- Approximating Boolean functions by OBDDs
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
- Asymptotically optimal bounds for OBDDs and the solution of some basic OBDD problems
- Minimization problems for parity OBDDs
Cites Work
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Branching Programs and Binary Decision Diagrams
- A note on matrix rigidity
- On relations between counting communication complexity classes
- On arithmetic branching programs
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- On oblivious branching programs of linear length
Cited In (7)
- On the hardness of approximating the minimum consistent OBDD problem
- Approximating Boolean functions by OBDDs
- Mathematical Foundations of Computer Science 2004
- Introduction to the OBDD algorithm for the ATP community
- Efficient Approximation of Well-Founded Justification and Well-Founded Domination
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard
- Hierarchy theorems for \(k\)OBDDs and \(k\)IBDDs
This page was built for publication: On approximation by \(^{\oplus}\)-OBDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845954)
