Probabilistic verification of Boolean functions

DOI10.1007/BF00464357zbMath0777.94021OpenAlexW2069530808MaRDI QIDQ685120

Jacob A. Abraham, Donald S. Fussell, Jawahar Jain, James R. Bitner

Publication date: 30 September 1993

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00464357

zbMATH Keywords

Boolean functionsprobabilistic verificationalgebraic transformshash codesinequivalent functionsorthogonal partitioning

Mathematics Subject Classification ID

Related Items (4)

On the Complexity of the Hidden Weighted Bit Function for Various BDD Models ⋮ Computing Boolean Functions via Quantum Hashing ⋮ Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication ⋮ Complexity Theoretical Results on Nondeterministic Graph-driven Read-Once Branching Programs

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

This page was built for publication: Probabilistic verification of Boolean functions