Stephen J. Bellantoni  Home/Search
Context Related
| toronto.edu/pub/report...cs92264.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: princeton.edu/~nelson/pt (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The purpose of this thesis is to give a "foundational" characterization of some common complexity classes. Such a characterization is distinguished by the fact that no explicit resource bounds are used. For example, we characterize the polynomial time computable functions without making any direct reference to polynomials, time, or even computation. Complexity classes characterized in this way include polynomial time, the functional polytime hierarchy, the logspace decidable problems, and NC.... (Update)
Cited by: More
A Functional Language for Logarithmic Space - Neergaard (2004) (Correct)
A Probabilistic Polynomial-Time Calculus for the.. - Mitchell.. (2002) (Correct)
Unifying Equivalence-Based Definitions of Protocol.. - Datta, Küsters.. (2004) (Correct)
Active bibliography (related documents): More All
0.6: A New Recursion-Theoretic - Characterization Of The (Correct)
0.5: Consistency and Games|in Search of New Combinatorial - Principles Pavel Pudl (Correct)
0.4: A New Parallel Vector Model, With Exact Characterizations of NC k - Regan (1993) (Correct)
Similar documents based on text: More All
0.5: V-Horn: a Horn-based second-order theory of arithmetic - Kolokolova (2000) (Correct)
0.1: Characterizing the Grzegorczyk hierarchy by safe recursion - Wirz (1999) (Correct)
0.1: A Safe Recursion Scheme for Exponential Time - Clote (1997) (Correct)
Related documents from co-citation: More All
19: A New Recursion-Theoretic Characterization of the Polytime Functions (context) - Bellantoni, Cook - 1992
9: Type Systems for Polynomial-time Computation - Hofmann - 1999
9: Ramified Recurrence and Computational Complexity I: Word recurrence and poly-tim.. (context) - Leivant - 1995
BibTeX entry: (Update)
S. Bellantoni, "Predicative Recursion and Computational Complexity", T.R. 264/92, Department of Computer Science, University of Toronto, September 1992. http://citeseer.ist.psu.edu/bellantoni92predicative.html More
@misc{ bellantoni92predicative,
author = "S. Bellantoni",
title = "Predicative Recursion and Computational Complexity",
text = "S. Bellantoni, Predicative Recursion and Computational Complexity, T.R.
264/92, Department of Computer Science, University of Toronto, September
1992.",
year = "1992",
url = "citeseer.ist.psu.edu/bellantoni92predicative.html" }
Citations (may not include all citations):96 A New Recursion-Theoretic Characterization of the Polytime F.. (context) - Bellantoni, Cook - 1992
16 The polynomial hierarchy and intuitionistic bounded arithmet.. (context) - Buss - 1986
15 Princeton University (context) - Bennett, Spectra et al. - 1962
15 machine-independent characterizations of the parallel comple.. (context) - Clote
14 Mathematics as a numerical language (context) - Bishop - 1970
5 Arithmetizing Uniform NC (context) - Allen - 1991
4 private communication (context) - Buss - 1991
3 Functional Characterizations of Uniform Log-depth and Polylo.. (context) - Bloch - 1992
2 Divide and Conquer in Parallel Complexity and Proof Theory (context) - Bloch - 1992
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC