A new recursion-theoretic characterization of the polytime functions-Reference-Cited by-同舟云学术

A new recursion-theoretic characterization of the polytime functions

Published:1992-06 Issue:2 Volume:2 Page:97-110
ISSN:1016-3328
Container-title:Computational Complexity
language:en
Short-container-title:Comput Complexity

Author:

Bellantoni Spephen,Cook Stephen

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics,Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01201998.pdf

Reference25 articles.

1. B. Allen, ?Arithmetizing Uniform NC?,Annals of Pure and Applied Logic, p. 1?50, v. 53 (1991).

2. S. Bellantoni, ?Predicative Recursion and Computational Complexity?, PhD Thesis, University of Toronto, 1992 (to appear).

3. S. Bellantoni and S. Cook, ?A New Recursion-Theoretic Characterization of the Polytime Functions (Extended Abstract)?, inProc. 24th Symposium on the Theory Of Computing, ACM, 1992.

4. S. Bloch, ?Functional Charaterizations of Uniform Log-depth and Polylogdepth Circuit Families?, inProc., Structure in Complexity Theory, to appear, IEEE, 1992.

5. S. Buss, ?Bounded Arithmetic?, Ph.D. Dissertation, Princeton University, 1985; reprinted Bibliopolis, Naples, 1986.

Cited by 220 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Declassification Policy for Program Complexity Analysis;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Polynomial Time and Dependent Types;Proceedings of the ACM on Programming Languages;2024-01-05

3. On Basic Feasible Functionals and the Interpretation Method;Lecture Notes in Computer Science;2024

4. A Characterization of Functions over the Integers Computable in Polynomial Time Using Discrete Ordinary Differential Equations;computational complexity;2023-07-12

5. A General Noninterference Policy for Polynomial Time;Proceedings of the ACM on Programming Languages;2023-01-09