Alogtime algorithms for tree isomorphism, comparison, and canonization

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

Volumn 1289, Issue , 1997, Pages 18-33

  Buss, Samuel R ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER CIRCUITS; LOGIC PROGRAMMING; SET THEORY;

CANONICAL TREE; ISOMORPHISM PROBLEMS; LOGARITHMIC TIME; TREE COMPARISON;

FORESTRY;

EID: 84947942216     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63385-5_30     Document Type: Conference Paper

References (13)

1. A. V. AHO, J, E, HOPCROFT, AND J. D. ULLMAN, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974.
2. 1, J. Comput. System Sci., 38 (1989), pp. 150-164.
3. S. R. Buss, The Boolean formula value problem is in ALOGTIME, in Proceedings of the 19-th Annual ACM Symposium on Theory of Computing, May 1987, pp. 123-131.
4. S. R. Buss, Algorithms for Boolean formula evaluation and for tree contraction, in Arithmetic, Proof Theory and Computational Complexity, P. Clote and J. Krajíček, eds., Oxford University Press, 1993, pp. 96-115.
5. S. R. Buss, S. A. COOK, A. GUPTA, AND V. RAMACHANDRAN, An optimal parallel algorithm for formula evaluation, SIAM J. Comput., 21 (1992), pp. 755-780.
6. P. B. GIBBONS, R. M. KARP, G. L. MILLER, AND D. SOROKER, Subtree isomorphism in in random NC, Discrete Applied Mathematics, 29 (1990), pp. 35-62.
7. N. IMMERMAN, Languages that capture complexity classes, SIAM Journal on Computing, 16 (1987), pp. 760-778.
8. S. LINDELL, A logspace algorithm for tree canonization, in Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 400-404.
9. A. LINGAS AND M. KARPINSKI, Subtree isomorphism is NC reducible to bipartite perfect matching, Information Processing Letters, 30 (1989), pp. 27-32.
10. R. J. LIPTON AND Y. ZALCSTEIN, Word problems solvable in logspace, J. Assoc. Comput. Mach., 24 (1977), pp. 522-526.
11. 5/2), Annals of Discrete Mathematics, 2 (1978), pp. 91-106.
12. G. L. MILLER AND J. H. REIF, Parallel tree contraction part 2: Further applications, SIAM Journal on Computing, 20 (1991), pp. 1128-1147.
13. W. L. Ruzzo, On uniform circuit complexity, J. Comput. System Sci., 22 (1981), pp. 365-383.