Approximating Boolean functions by OBDDs
From MaRDI portal
Recommendations
- Mathematical Foundations of Computer Science 2004
- On the OBDD-representation of general Boolean functions
- On approximation by \(^{\oplus}\)-OBDDs
- Optimal bounds for the approximation of Boolean functions and some applications
- Optimal bounds on the approximation of Boolean functions with consequences on the concept of hardness
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
- Approximating Boolean functions with depth-2 circuits
- Computations in Boolean algebra with approximation
- Boolean algebra approximations
- Asymptotically optimal Boolean functions
Cites work
- scientific article; zbMATH DE number 1688393 (Why is no real title available?)
- scientific article; zbMATH DE number 1263188 (Why is no real title available?)
- scientific article; zbMATH DE number 1263236 (Why is no real title available?)
- scientific article; zbMATH DE number 815575 (Why is no real title available?)
- A Reliable Randomized Algorithm for the Closest-Pair Problem
- A lower bound for integer multiplication on randomized ordered read-once branching programs.
- A read-once branching program lower bound of \({\omega}(2^{n/4})\) for integer multiplication using universal hashing
- Branching Programs and Binary Decision Diagrams
- Communication Complexity
- Graph-Based Algorithms for Boolean Function Manipulation
- On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
- Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
- Read-once projections and formal circuit verification with binary decision diagrams
- Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
Cited in
(6)- On approximation by \(^{\oplus}\)-OBDDs
- Approximation of Boolean functions by local search
- On the second-order nonlinearity of the hidden weighted bit function
- On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
- Mathematical Foundations of Computer Science 2004
- OBDD minimization based on two-level representation of Boolean functions
This page was built for publication: Approximating Boolean functions by OBDDs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867861)
