Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)

This publication has 11 references indexed in Scilit:

• Algebraic Structures with Hard Equivalence and Minimization Problems
  Journal of the ACM, 1984
• A simplified NP-complete satisfiability problem
  Discrete Applied Mathematics, 1984
• Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs
  Journal of the ACM, 1983
• Decision Trees and Diagrams
  ACM Computing Surveys, 1982
• Equivalence of free boolean graphs can be decided probabilistically in polynomial time
  Information Processing Letters, 1980
• The Complexity of Enumeration and Reliability Problems
  SIAM Journal on Computing, 1979
• Binary Decision Diagrams
  IEEE Transactions on Computers, 1978
• Complexity of automaton identification from given data
  Information and Control, 1978
• Probabilistic Treatment of General Combinational Networks
  IEEE Transactions on Computers, 1975
• The complexity of theorem-proving procedures
  Published by Association for Computing Machinery (ACM) ,1971