On the complexity of analysis and manipulation of Boolean functions in terms of decision graphs

Publisher Website

1 June 1994

journal article
Published by Elsevier in Information Processing Letters

Vol. 50 (6) , 317-322
https://doi.org/10.1016/0020-0190(94)00048-4

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

Sequential circuit verification using symbolic model checking
Published by Association for Computing Machinery (ACM) ,1990
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers, 1986
Equivalence of free boolean graphs can be decided probabilistically in polynomial time
Information Processing Letters, 1980
Binary Decision Diagrams
IEEE Transactions on Computers, 1978
The complexity of equivalence and containment for free single variable program schemes
Published by Springer Nature ,1978
Representation of Switching Circuits by Binary-Decision Programs
Bell System Technical Journal, 1959