Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith  Home/Search
Context Related
| informatik.unitrier.de/pub/...Paper.ps eccc.unitrier.de/pub/eccc/r...Paper.ps 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: fermivista.math...ik.unitrier.de (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We define the sharply bounded hierarchy, SBH (QL), a hierarchy of classes within P , using quasilinear-time computation and quantification over values of length log n. It generalizes the limited nondeterminism hierarchy introduced by Buss and Goldsmith, while retaining the invariance properties. The new hierarchy has several alternative characterizations. We define both SBH (QL) and its corresponding hierarchy of function classes, FSBH(QL),and present a variety of problems in these classes,... (Update)
Context of citations to this paper: More
.... Bounded Hierarchy, an alternation based hierarchy built on quasilinear time and O(log n) bit existential and universal quantifiers [5, 9]. Extensive studies are done on limited nondeterminism in the context of finite automata and pushdown automata. See [19] 20] 26]...
.... literature about characterizing computational complexity classes in terms of algebraic recursion schemes, e.g. [Cob64, Gur83, GS89, CL90, BC92, Bel95, GG95, Lei95, BBG96]. In this paper, we invent a recursion scheme for unary functions that allows composition of functions and...
Cited by: More
Computation Models and Function Algebras - Clote (1996) (Correct)
Algebraic and Logical Characterizations of Deterministic Linear .. - Schwentick (1996) (Correct)
Limited Nondeterminism - Goldsmith, Levy, Mundhenk (1996) (Correct)
Similar documents (at the sentence level):
78.2%: Sharply Bounded Alternation within P - Bloch (1995) (Correct)
63.6%: Sharply Bounded Alternation and Quasilinear Time - Bloch, Buss, Goldsmith (1997) (Correct)
Active bibliography (related documents): More All
0.3: On Quasilinear Time Complexity Theory - Naik, Regan, Sivakumar (1994) (Correct)
0.3: Machine Models and Linear Time Complexity - Regan (1993) (Correct)
0.3: The Computational Power of Discrete Hopfield Nets with Hidden Units - Orponen (1996) (Correct)
Similar documents based on text: More All
0.5: On-Orbit Estimates of Telescope Misalignment and Quaternion-Based.. - Team (1997) (Correct)
0.5: On P versus NP∩co-NP for Decision Trees and.. - Jukna, Razborov.. (1997) (Correct)
0.5: Lower Bounds for the Polynomial Calculus and the Gröbner .. - Impagliazzo, Pudlák, al. (1997) (Correct)
Related documents from co-citation: More All
2: Predicative Recursion and the Polytime Hierarchy (context) - Bellantoni - 1995
2: A New Recursion-Theoretic Characterization of the Polytime Functions (context) - Bellantoni, Cook - 1992
BibTeX entry: (Update)
S. A. Bloch, J.F. Buss, and J. Goldsmith. Sharply bounded alternation within P. Submitted, http://www.cs.engr.uky.edu/¸goldsmit/main.ps. http://citeseer.ist.psu.edu/article/bloch96sharply.html More
@article{ buss96sharply,
author = "Stephen A. Bloch and Jonathan F.
Buss and Judy Goldsmith",
title = "Sharply Bounded Alternation within P",
journal = "Electronic Colloquium on Computational Complexity (ECCC)",
volume = "3",
number = "011",
year = "1996",
url = "citeseer.ist.psu.edu/article/bloch96sharply.html" }
Citations (may not include all citations):773 Reducibility among combinatorial problems (context) - Karp - 1972
454 the uniform convergence of relative frequencies of events to.. (context) - Vapnik, Chervonenkis - 1971
245 Relational queries computable in polynomial time - Immerman - 1986
222 Fixed parameter tractability and completeness IV: on complet.. - Abrahamson, Downey et al. - 1993
211 Languages that capture complexity classes - Immerman - 1987
149 Logic and the challenge of computer science (context) - Gurevich - 1987
103 Bounded Arithmetic (context) - Buss - 1986
97 Limits to Parallel Computation: P - Completeness Theory - Greenlaw, Hoover et al. - 1995
96 A new recursion-theoretic characterization of the polytime f.. (context) - Bellantoni, Cook - 1992
95 Fixed-point extensions of first-order logic (context) - Gurevich, Shelah - 1986
61 Relations among complexity measures (context) - Pippenger, Fischer - 1979
51 Nondeterminism within P (context) - Buss, Goldsmith - 1993
50 Complete problems for deterministic polynomial time (context) - Jones, Laaser - 1976
45 Expressibility and parallel complexity - Immerman - 1989
40 Fixed-parameter intractability (context) - Downey, Fellows - 1992
39 Bounded linear logic: a modular approach to polynomial time .. (context) - Girard, Scedrov et al. - 1990
39 Algebras of feasible functions (context) - Gurevich - 1983
34 Alternation (context) - Chandra, Kozen et al. - 1981
32 Refining nondeterminism in relativized polynomialtime bounde.. (context) - Kintala, Fischer - 1980
27 Results on learnability and the VapnikChervonenkis dimension (context) - Linial, Mansour et al. - 1991
27 Classes of bounded nondeterminism (context) - D'iaz, Tor'an - 1990
26 Predicative Recursion and Computational Complexity - Bellantoni - 1992
24 A note on the expressive power of PROLOG (context) - Papadimitriou - 1985
23 Downward separation fails catastrophically for limited nonde.. - Beigel, Goldsmith - 1994
20 Nearly linear time (context) - Gurevich, Shelah - 1989
19 Paths, trees, and flowers (context) - Edmonds - 1965
19 Department of Mathematics (context) - Bennett, Spectra et al. - 1962
17 Defying upward and downward separation (context) - Hemachandra, Jha - 1993
17 Satisfiability is quasilinear complete in NQL (context) - Schnorr - 1978
16 the amount of nondeterminism and the power of verifying - Cai, Chen - 1993
14 A foundational delineation of computational feasibility (context) - Leivant - 1994
14 Inductive definitions over finite structures (context) - Leivant - 1990
10 Complexity classes with complete problems between P and NP-c.. (context) - 'Alvarez, D'iaz et al. - 1989
10 Predicative recursion and the polytime hierarchy (context) - Bellantoni - 1995
9 On uniformity in NC (context) - Barrington, Immerman et al. - 1990
8 the notion of linear-time computability (context) - Gradel - 1990
7 A theory of Strict P -completeness - Condon - 1994
7 Subrecursion and lambda representation over free algebras (context) - Leivant - 1990
6 Quasilinear-time complexity theory - Naik, Regan et al.
6 Sequential, machine-independent characterizations of the par.. (context) - Clote - 1990
6 Relativized Alternation and Space-Bounded Computation (context) - Buss - 1988
5 Computational complexity of higher-type functions (context) - Cook - 1990
5 Linear time and memory-efficient computation - Regan - 1992
5 Complexity and relational query languages (context) - Vardi - 1982
4 Hierarchies in transitive-closure logic, stratified Datalog,.. - Gradel, McColm - 1992
3 Fast simulation of combinational logic circuits by machines .. (context) - Pippenger - 1977
3 Alternating function classes within P (context) - Bloch - 1992
3 Simple local search problems that are hard to solve (context) - Papadimitriou, Schaffer et al. - 1991
3 Tiers, tensor, and the linear-time hierarchy (context) - Otto - 1995
3 Rudimentary predicates and the linear-time hierarchy (context) - Wrathall - 1978
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.informatik.uni-trier.de.html): More
Symmetric Logspace is Closed Under Complement - Nisan, Ta-Shma (1994) (Correct)
Pattern-Matching for Strings with Short Descriptions - Karpinski, al. (1995) (Correct)
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem - Goldreich, al. (1997) (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