Joel I. Seiferas, Albert R. Meyer  Home/Search
Context Related
| rochester.edu/pub/...complexities.ps.gz 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: rochester.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . This is a complete exposition of a tight version of a fundamental theorem of computational complexity due to Levin: The inherent space complexity of any partial function is very accurately specifiable in a \Pi 1 way, and every such specification that is even \Sigma 2 does characterize the complexity of some partial function, even one that assumes only the values 0 and 1. 1. Introduction Some computational problems have nearly best algorithms, and others do not. By "best", we mean essentially ... (Update)
Context of citations to this paper: More
.... the machines to be able to detect the limits of previously used space without having to devote any resources to marking them [as in SM95, for example]. Additional control states make it easy to go through this count k times. The versions of our transformation and result for...
Cited by: More
Fundamentals of Computing - Leonid Levin These (Correct)
Amplification of Slight Probabilistic Advantage at.. - Ioan I. Macarie.. (1998) (Correct)
Effective Category and Measure in Abstract Complexity Theory.. - Calude, al. (1995) (Correct)
Active bibliography (related documents): More All
0.5: On Average Time Hierarchies - Goldmann, Grape, Hastad (1997) (Correct)
0.4: On Type-2 Complexity Classes - Li, Royer (2001) (Correct)
0.3: Learning From Context Without Coding-Tricks - Case, Jain, Stephan (Correct)
Similar documents based on text: More All
0.1: Hierarchy Theorems - September At This (Correct)
0.0: Sorting and Searching With a Faulty Comparison Oracle - Long (1992) (Correct)
0.0: Bits and Relative Order from Residues, Space Efficiently - Dietz, Macarie, Seiferas (1994) (Correct)
Related documents from co-citation: More All
3: A machine-independent theory of the complexity of recursive functions (context) - Blum - 1967
2: IFIP World Computer Congress (context) - Robson, of et al. - 1983
2: The Art of Computer Programming (context) - Knuth - 1968
BibTeX entry: (Update)
J. Seiferas and A. R. Meyer. Characterization of realizable space complexities, Annals of Pure and Applied Logic (to appear). http://citeseer.ist.psu.edu/seiferas94characterization.html More
@techreport{ seiferas95characterization,
author = "Joel I. Seiferas and Albert R. Meyer",
title = "Characterization of Realizable Space Complexities",
number = "TR572",
year = "1995",
url = "citeseer.ist.psu.edu/seiferas94characterization.html" }
Citations (may not include all citations):1911 Introduction to Automata Theory (context) - Hopcroft, Ullman - 1979
83 A machine-independent theory of the complexity of recursive .. (context) - Blum - 1967
71 An Introduction to the General Theory of Algorithms (context) - Machtey, Young - 1978
26 Godel numberings of partial recursive functions (context) - Rogers - 1958
18 Halting space-bounded computations (context) - Sipser - 1980
17 McGraw-Hill (context) - Recursive, Effective - 1967
12 Computational complexity and the existence of complexity gap.. (context) - Borodin - 1972
9 Hierarchies of memory limited computations (context) - Stearns, Hartmanis - 1965
6 Degree of difficulty of computing a function and a partial o.. (context) - Rabin - 1960
4 Relating refined space complexity classes (context) - Seiferas - 1977
3 Computational speed-up by effective operators (context) - Meyer, Fischer - 1972
3 Journal of the Association for Computing Machinery (context) - Constable, gap - 1972
3 On storage capacity for algorithms (context) - Levin - 1973
2 The fundamental theorem of complexity theory (context) - Meyer, Winklmann - 1979
2 Complexity of algorithms and computations (context) - Trakhtenbrot - 1967
1 Journal of the Association for Computing Machinery (context) - procedures, up - 1971
1 Zeitschrift fur Mathematische Logik und Grundlagen der Mathe.. (context) - Schnorr, Stumpf et al. - 1975
1 Theoretical Computer Science (context) - of
1 Complexity of Computations and Algorithms (context) - computation, functions - 1974
1 REALIZABLE SPACE COMPLEXITIES (context) - Lynch, Several et al. - 1975
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.rochester.edu.html): More
A Downward Translation in the Polynomial Hierarchy - Hemaspaandra, Hemaspaandra.. (1997) (Correct)
Software Cache Coherence for Large Scale Multiprocessors - Kontothanassis, Scott (1994) (Correct)
On-line Estimation of Visual-Motor Models for Robot Control and.. - Jägersand (Correct)
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