Resolution and Binary Decision Diagrams Cannot Simulate Each Other Polynomially
Authors:
- 18 December 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 33-38
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- Resolution and Binary Decision Diagrams Cannot Simulate Each Other PolynomiallyLecture Notes in Computer Science, 2001
- A rewriting approach to binary decision diagramsThe Journal of Logic and Algebraic Programming, 2001
- Algorithms and Data Structures in VLSI Design1998
- Hard examples for resolutionJournal of the ACM, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- The intractability of resolutionTheoretical Computer Science, 1985