Author:
Balcázar J. L.,Díaz J.,Gabarró J.
Reference15 articles.
1. S. Aanderaa, E. Börger: The equivalence of Horn and network complexity for boolean functions. Acta Informatica 15 (1981), 303–307.
2. L. Berman, J. Hartmanis: On isomorphism and density of NP and other complete sets, SIAM J. Comp 6 (1977), 305–322.
3. A. Borodin, I. Munro: The computational complexity of algebraic and numeric problems. American Elsivier (1975).
4. F. Brandenburg: On one-way auxiliary pushdown automata, 3rd GI conf. Theor. Comp. Sci. (1977), LNCS 48 132–144.
5. W. Bucher, K. Culik, H. Maurer, D. Wotschke: Concise description of finite languages. TCS 14 (1981), 227–246.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Characterizations of PUNC and precomputation;Automata, Languages and Programming;1986
2. The complexity of sparse sets in P;Structure in Complexity Theory;1986