A characterization and nearly linear-time equivalence test for μ-branching programs

Theory of Computing Systems

Volumn 30, Issue 3, 1997, Pages 249-283

  Raghavan, V ^a   Wilkins, D ^b  

^a VANDERBILT UNIVERSITY   (United States)

^b The University of Mississippi   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; EQUIVALENCE CLASSES; TREES (MATHEMATICS);

ACKERMANN FUNCTIONS; BRANCHING PROGRAMS; DECOMPOSITION TREES; EQUIVALENCE TESTING; EQUIVALENCE TESTS; FUNCTIONAL INVERSE; LINEAR TIME; NP COMPLETE;

FUNCTIONS;

EID: 0040060273     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/bf02679462     Document Type: Article

References (17)

1. S. B. Akers. Binary Decision Diagrams. IEEE Transaction on Computers, 27(6):509-516, 1978.
2. D. Angluin. Queries and Concept Learning. Machine Learning, 2:319-342, 1988.
3. 1. Journal of Computer and System Sciences, 38:150-164, 1989.
4. M. Blum, A. Chandra, and M. Wegman. Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Information Processing Letters, 10:80-82, 1980.
5. R. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
6. R. L. Constable, H. B. Hunt, III, and S. Sahni. On the Computational Complexity of Scheme Equivalence. Proceedings of the 8th Princeton Conference on Information Sciences and Systems, pages 15-20, 1974.
7. S. Fortune, J. Hopcroft, and E. Schmidt. The Complexity of Equivalence and Containment for Free Single Variable Program Schemes. Lecture Notes in Computer Science: Automata, Languages Programming, 62:227-240, 1978.
8. J. Gergov and C. Meinel. Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs. Graph-Theoretic Concepts in Computer Science. LNCS, volume 657, pages 310-320. Springer-Verlag, Berlin, 1992.
9. J. Gergov and C. Meinel. Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs. STACS '93. LNCS, volume 665, pages 576-585. Springer-Verlag, Berlin, 1993.
10. T. Hancock. Identifying μ-Formula Decision Trees with Queries. Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 23-37, 1990.
11. C. Y. Lee. Representation of Switching Circuits by Binary-Decision Programs. Bell System Technical Journal, 38(4):985-999, 1959.
12. C. Meinel. Modified Branching Programs and Their Computational Power. LNCS, volume 370. Springer-Verlag, Berlin, 1989.
13. S. Ponzio. A Lower Bound for Integer Multiplication with Read-Once Branching Programs. Proceedings of the 21th Annual ACM Symposium on Theory of Computing, pages 130-139, 1995.
14. V. Raghavan and D. Wilkins. Learning μ-Branching Programs with Queries. Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory, pages 27-36, 1993.
15. R. E. Tarjan. Data Structures and Network Algorithms. SIAM, Philadelphia, PA, 1983.
16. I. Wegener. The Complexity of Boolean Functions. Wiley, New York, 1987.
17. D. Wilkins. Learning Restricted-Read Branching Programs with Queries. Ph.D. thesis, Vanderbilt University, 1995.