The Complexity of Very Simple Boolean Formulas with Applications

This publication has 26 references indexed in Scilit:

• Algebraic Structures with Hard Equivalence and Minimization Problems
  Journal of the ACM, 1984
• On the unique satisfiability problem
  Information and Control, 1982
• An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
  IEEE Transactions on Computers, 1981
• 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
• Diagnosis & Reliable Design of Digital Systems
  Published by Springer Nature ,1976
• Computational complexity of decision procedures for polynomials
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• A note on disjunctive form tautologies
  ACM SIGACT News, 1973
• Hazard Detection in Combinational and Sequential Switching Circuits
  IBM Journal of Research and Development, 1965