Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science
Reference21 articles.
1. William Allen, Arithmetizing uniformNC.Annals of Pure and Applied Logic 53(1) (1991), 1?50. See alsoDivide and Conquer as a Foundation of Arithmetic, Ph. D. thesis, University of Hawaii at Manoa, 1988.
2. Toshiyasu Arai, Frege systems, ALOGTIME and bounded arithmetic. Manuscript, 1992.
3. D. A. Barrington, Bounded-width polynomial-size branch programs recognize exactly those languages inNC 1.J. Comput. Sys. Sci. 38(1) (1989), 150?164. See alsoProc. Eighteenth Ann. ACM Symp. Theor. Comput., ACM Press 1986, 1?5.
4. David A. Mix Barrington, Quasipolynomial size circuit classes. InProceedings of the Seventh Annual Structure in Complexity Theory Conference. IEEE Computer Society Press, 1992, 86?93.
5. Stephen Bellantoni,Predicative Recursion and Computational Complexity. PhD thesis, University of Toronto, 1992.
Cited by
16 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献