Complexity of problems on graphs represented as OBDDs (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1373 LNCS, Issue , 1998, Pages 216-226

  Feigenbaum, J ^a   Kannan, S ^b   Vardi, M Y ^c   Viswanathan, M ^b  

^a AT AND T LABS RESEARCH   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOW-UP; DECISION PROBLEMS; EXTENDED ABSTRACTS; GRAPH PROBLEMS; INPUT GRAPHS; INPUT SIZE; ORDERED BINARY DECISION DIAGRAMS; PROBLEM COMPLEXITY;

COMPUTER SCIENCE;

BINARY DECISION DIAGRAMS;

EID: 78649805666     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0028563     Document Type: Conference Paper

References (24)

1. J. L. Balcázar, The Complexity of Searching Implicit Graphs, Aritificial Intelligence, 86 (1996), pp. 171-188.
2. J. L. Balcázar and A. Lozano, The complexity of graph problems for succinctly represented graphs, in Proc. Graph-Theoretic Concepts in Computer Science, Springer-Verlag, Lecture Notes in Computer Science 411, 1989, pp. 277-285.
3. J.L. Balcázar, A. Lozano, and J. Torán, The complexity of Algorithmic Problems on Succinct Instances, Computer Science (R. Baeza-Yates and U. Manber, Eds.), Plenum Press, New York, 1992, pp. 351-377.
4. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli, Methodology and system for practical formal verification of reactive hardware, in Proc. 6th Int'l Conf. on Computer-Aided Verification, Springer-Verlag, Lecture Notes in Computer Science 818, 1994, pp. 182-193.
5. C. L. Berman, Ordered Binary Decision Diagrams and Circuit Structure, in Proc. IEEE International Conf. on Computer Design, 1989, pp. 392-395.,
6. R. Brayton, A. Emerson, and J. Feigenbanm, Workshop Summary: Computational and Complexity Issues in Automated Verification, DIMACS Technical Report 96-15, Rutgers University, Piscataway NJ, June 1996.
7. R. Bryant, Graph-Based Algorithms for Boolean Function Manipulation, IEEE Transactions on Computers, C-35 (1986), pp. 677-691.
8. R. Bryant, Symbolic Manipulation with Ordered Binary Decision Diagrams, ACM Computing Surveys, 24 (1992), pp. 293-318.
9. 20 states and beyond, Information and Computation, 98 (1992), pp. 142-170.
10. E. M. Clarke, O. Grnmberg, H. Hiraishi, S. Jha, D. E. Long, K. L. McMillan, and L. A. Ness, Verification of the Futurebus+ Cache Coherence Protocol, Formal Methods in System Design, 6 (1995), pp. 217-232.
11. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms, The M.I.T. Press, Cambridge, MA (1989).
12. E. A. Emerson and C. L. Lei, Efficient Model Checking in Fragments of the Propositional mu-Calculus, Proc. 1st IEEE Symp. on Logic in Computer Science, 1986, pp. 267-278.
13. H. Galperin and A. Wigderson, Succinct Representations of Graphs, Information and Control, 56 (1983), pp. 183-198.
14. O. Kupferman and M. Y. Vardi, Module checking, Proc. 8th Int'l. Conf. on Computer-Aided Verification, Springer-Verlag, Lecture Notes in Computer Science 1102, 1996, pp. 75-86.
15. R. Kurshan, Computer-Aided Verification of Coordinating Processes: The Automata-Theoretic Approach, Princeton University Press, Princeton NJ, 1994.
16. R. Kurshan, The Complexity of Verification, Proc. 26th ACM Symp. on Theory of Computing, Montreal, 1994, pp. 365-371.
17. K. McMillan, Symbolic Model Checking, Kluwer Academic Publishers, Amsterdam, 1993.
18. C. Papadimitriou and M. Yannakakis, A Note on Succinct Representations of Graphs, Information and Control, 71 (1986), pp. 181-185.
19. S. Ponzio, A lower bound for integer multiplication with read-once branching programs, Proc. 27th ACM Syrup. on Theory of Computation, Las Vegas, 1995, pp. 130-139.
20. S. Ponzio, Restricted Branching Programs and Hardware Verification, PhD Thesis, MIT, 1995.
21. S. Skyum and L. Valiant, A Complexity Theory Based on Boolean Algebra, in Proc. 23rd IEEE Syrup. on Foundations of Computer Science, 1982, pp. 244-253.
22. J. Torán, Succinct representations of counting problems, Proc. 6th International Conf. on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, Springer-Verlag, Lecture Notes in Computer Science 357, 1988, pp. 415-426.
23. H. Veith, Languages Represented by Boolean Formulas, TU Vienna, TR CD 85/95, 1995.
24. H. Veith, Succinct Representation, Leaf Languages, and Projection Reductions, in Proc. 11th IEEE Conf. on Computational Complexity, 1996, pp. 118-126.