A note on the relation between polynomial time functionals and constable's class K

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

Volumn 1092, Issue , 1996, Pages 145-160

  Clote, P ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

POLYNOMIAL APPROXIMATION; RECONFIGURABLE HARDWARE;

FUNCTIONALS; INCREASING FUNCTIONS; POLYNOMIAL-TIME;

COMPUTER CIRCUITS;

EID: 84957620902     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_36     Document Type: Conference Paper

References (24)

1. B. Allen. Arithmetizing uniform NC. Annals of Pure and Applied Logic, 53(1):1-50, 1991.
2. D. Mix Barrington, N. Immerman, and H. Stranbing. On uniformity in NC 1. Journal of Computer and System Science, 41(3):274-306, 1990.
3. P. Clote. Polynomial size frege proofs of certain combinatorial principles. In P. Clote and J. Krajíček, editors, Arithmetic, Proo] Theory and Computational Complexity, pages 162-184. Oxford University Press, 1993.
4. P. Clote. Computation models and function algebras. In E. Criffor, editor, Handbook of Recursion Theory. in preparation.
5. P. Clote, B. Kapron, and A. Ignjatovic. Parallel computable higher type functionals. Technical Report BCCS-94-04, Department of Computer Science, Boston College, June 1994.
6. P. Clote, B. Kapron, and A. Ignjatovic. Parallel computable higher type functionals. In Proceedings of IEEE 34th Annual Symposium on Foundations of Computer Science, Nov 3-5,1993. Palo Alto CA. pp. 72-83.
7. P. Clote and G. Takeuti. First order bounded arithmetic and small boolean circuit complexity classes. In P. Clote and J. Remmel, editors, Feasible Mathematics II, pages 154-218. Birkh/iuser Boston Inc., 1995.
8. Peter Clote and Evangelos Kranakis. Boolean functions, invariance groups and parallel complexity. SIAM J. Comput. 20:553-590, 1991.
9. P.G. Clote. Sequential, mm=hine4ndependent characterizations of the parallel complexity classes ALOGTIME, AC k, NC k and NC. In P.J. Scott S.R. Buss, editor, Feasible Mathematics, pages 49-70. Birkhs 1990.
10. A. Cobham. The intrinsic computational difficulty of functions. In Y. Bar-Hillel, editor, Logic, Methodology and Philosophy of Science II, pages 24-30. North- Holland, 1965.
11. R. Constable. Type 2 computational complexity. In 5th Annual ACM Symposium on Theory of Computing, 1973. pp. 108-121.
12. J. Edmonds. Paths, trees, flowers. Canad. J. Math., 17:449-467, 1965.
13. L. Kálmar Egyszerü pé1da eldönthetetlen aritmetkil problémára Mate és Fizikai Lapok 50:1-23, 1943. [In Hungarian with German abstract].
14. B. Kapron and S. Cook. A new characterization of Mehlhorn's poly time functionals. In Proceedings of IEEE 32th Annual Symposium on Foundations of Computer Science, pages pp. 342-347,1991. Journal version in SIAM J. on Comput.
15. J.C. Lind. Computing in logarithmic space. Technical Report Project MAC TechnicaJ Memorandum 52, Massachusetts Institute of Technology, September 1974.
16. K. Mehlhorn. Polynomial and abstract subrecursive classes. Journal of Computer and System Science, 12:147-178, 1976.
17. B. Monien. A recursive and grammatical characterization of exponential time languages. Theoretical Computer Science, 3:61-74, 1977.
18. R.W. Ritchie. Classes of predictably computable functions. Trans. Am. Math. Soc., 106:139-173, 1963.
19. H. E. Rose. Subrecursion: Function and Hierarchies, volume 9 of Oxford Logic Guides. Clarendon Press, Oxford, 1984. 191 pages.
20. D.B. Thompson. Subrecursiveness: machine independent notions of computability in restricted time and storage. Math. Systems Theory, 6:3-15, 1972.
21. M. Townsend. Complexity for type-2 relations. Notre Dame Journal of Formal Logic, 31:241-262, 1990
22. K. Wagner. Bounded recursion and complexity classes. In Lecture Notes in Computer Science~ volume 74, pages 492-498. Springer-Verlag, 1979.
23. K. Wagner and C. Wechsung. Computational Complexity. Reidel Publishing Co., 1986.
24. C. Wilson. Relativized nc. Math. Systems Theory, 20:13-29, 1987.