Probabilistic verification of Boolean functions
From MaRDI portal
Publication:685120
DOI10.1007/BF00464357zbMath0777.94021MaRDI QIDQ685120
Jawahar Jain, Jacob A. Abraham, Donald S. Fussell, James R. Bitner
Publication date: 30 September 1993
Published in: Formal Methods in System Design (Search for Journal in Brave)
Boolean functions; probabilistic verification; algebraic transforms; hash codes; inequivalent functions; orthogonal partitioning
Related Items
On the Complexity of the Hidden Weighted Bit Function for Various BDD Models, Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs, Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication, Computing Boolean Functions via Quantum Hashing
Cites Work
- Unnamed Item
- Unnamed Item
- Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
- Graph-Based Algorithms for Boolean Function Manipulation
- A fast algorithm for finding dominators in a flowgraph
- Probabilistic Aspects of Boolean Switching Functions via a New Transform
- Probabilistic Treatment of General Combinational Networks
- Binary Decision Diagrams