Read-once projections and formal circuit verification with binary decision diagrams

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

Volumn 1046, Issue , 1996, Pages 491-502

  Bollig, Beate ^a   Wegener, Ingo ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; FORMAL VERIFICATION; GRAPHIC METHODS; INTEGRATED CIRCUIT MANUFACTURE; TIMING CIRCUITS;

CIRCUIT DESIGNS; CIRCUIT VERIFICATION; COMPLETE PROBLEMS; COMPLEXITY THEORY; COMPUTING FUNCTIONS; FREE BINARY DECISION DIAGRAMS; POLYNOMIAL SIZE;

BINARY DECISION DIAGRAMS;

EID: 84948146179     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60922-9_40     Document Type: Conference Paper

References (21)

1. M. Ajtai, L. Babai, A. Hajnal, J. Komlós, P. Pudlák, V. Rödl, E. Szemerédi and G. Turán: Two lower bounds for branching programs. 18. STOC, 30-38 (1986).
2. B. Becker, R. Drechsler and R. Werchner: On the relation between BDDs and FDDs. LATIN '95, LNCS 911, 71-83 (1995).
3. B. Bollig, M. Sauerhoff, D. Sieling and I. Wegener: On the power of different types of restricted branching programs. Submitted to Theoretical Computer Science. Electronic Colloquium in Computational Complexity, TR 94-026 (1994).
4. B. Bollig and I. Wegener: Read-once projections and formal circuit verification with binary decision diagrams. Electronic Colloquium in Computational Complexity, TR 95-045 (1995).
5. R. E. Bryant: Graph-based algorithms for Boolean function manipulation. IEEE Trans, on Computers 35, 677-691 (1986).
6. R. E. Bryant: Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24, 293-318 (1992).
7. A. Chandra, L. Stockmeyer and U. Vishkin: Constant depth reducibility. SIAM J. on Computing 13, 423-439 (1984).
8. M. R. Garey and D. B. Johnson: Computers and intractability-a guide to the theory of NP-completeness. Freeman, New York 1979.
9. J. Gergov and C. Meinel: Efficient Boolean manipulation with OBDDs can be extended to FBDDs. IEEE Trans, on Computers 43, 1197-1209 (1994).
10. A. Hajnal, W. Maass, P. Pudlák, M. Szegedy and G. Turán: Threshold circuits of bounded depth. 28. FOCS, 99-110 (1987).
11. J. Jain, M. Abadir, J. Bitner, D. S. Fussell and J. A. Abraham: IBDDs: an efficient functional representation for digital circuits. Proc. European Design Automation Conf., 440-446 (1992).
12. U. Kebschull, E. Schubert and W. Rosenstiel: Multilevel logic synthesis based on functional decision diagrams. Proc. European Design Automation Conf., 43-47 (1992).
13. M. Krause: Lower bounds for depth-restricted branching programs. Information and Computation 91, 1-14 (1991).
14. e. MFCS, LNCS 324, 405-413 (1988).
15. N. Nisan and A. Wigderson: Rounds in communication complexity revisited. SIAM J. on Computing 22, 211-219 (1993).
16. S. Ponzio: A lower bound for integer multiplication with read-once branching programs. 27. STOC, 130-139 (1995) (see also Ph. D. Thesis, MIT/LCS-TR-633. Sept. 1995).
17. D. Sieling and I. Wegener: Graph driven BDDs-a new data structure for Boolean functions. Theoretical Computer Science 141, 283-310 (1995).
18. K. S. Siu, J. Bruck, T. Kailath and T. Hofmeister: Depth-efficient neural networks for division and related problems. IEEE Trans, on Information Theory 39, 946-956 (1993).
19. S. Skyum and L. G. Valiant: A complexity theory based on Boolean algebra. Journal of the ACM 32, 484-502 (1985).
20. I. Wegener: Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions. Information Processing Letters 46, 85-87 (1993).
21. I. Wegener: Efficient data structures for Boolean functions. Discrete Mathematics 136, 347-372 (1994).