Stephen Bloch, Jonathan Buss, and Judy Goldsmith. Sharply bounded alternation within P. To appear in Proceedings, DMTCS '96; submitted for journal publication, 1995. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Computation Models and Function Algebras - Clote (1996) (9 citations) (Correct)
....some form of simultaneous very safe recursion (simultaneous recursion, since a pairing function apparently cannot be defined from the initial functions using safe composition such would be necessary for defining nextM ) a pairing function available) Details have been worked out by S. Bloch [15], and a related category theoretic characterization has been announced by J. Otto [105] 4 Type 2 functionals Many programming languages allow functions to be passed as parameters to other functions or procedures. For instance, in different limited manners pascal and c allow function parameters, ....
Stephen Bloch, Jonathan Buss, and Judy Goldsmith. Sharply bounded alternation within P. To appear in Proceedings, DMTCS '96; submitted for journal publication, 1995.
Algebraic and Logical Characterizations of Deterministic Linear .. - Schwentick (1996) (Correct)
....for a natural complete problem and a logical characterization of DLIN. The main intermediate step in attacking these problems is an algebraic characterization of DLIN. There is a large 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 simultaneous recursion with the operations iteration, addition, case distinction, bounded composition and bounded search. By varying the power of the bounded search operation we obtain ....
S.A. Bloch, J.F. Buss, and J. Goldsmith. Sharply bounded alternation within P. Technical Report TR96-011, Electronic Colloquium on Computational Complexity, 1996. http://ftp.eccc.unitrier. de/pub/eccc/reports/1996/TR96-011/index.html.
Limited Nondeterminism - Goldsmith, Levy, Mundhenk (1996) (15 citations) Self-citation (Goldsmith) (Correct)
.... by both limited nondeterminism and some form of alternation, such as the W hierarchy [15] a hierarchy within NP of parameterized problems [13] and the Sharply 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] 29] 28] and [35] for finite automata, and [32] 33] and [37] for pushdown automata. In this context, the limits on nondeterminism are more likely to be a ....
....; NC) 2. 12] fi k NC i contains L m complete sets for for all i 2 N ; k 2 N 0 . A similar result as in Theorem 3.7 for time bounded classes can be shown for space bounded classes. Theorem 3.14 [38] For any k 2 N , if SPACE(n ) sGC(n k ; NC) for some 0, then PSPACE = NP. In [5] a similar assumption for time bounded computations yields a stronger consequence: if S r DTIME(n k log r n) SBH for some k 1, then P = PSPACE, where SBH is the Sharply Bounded Hierarchy defined in [5] 3.3 Real Time Computations A real time machine (cf. 8] is a (multi tape) Turing ....
[Article contains additional citation context not shown here]
S. A. Bloch, J.F. Buss, and J. Goldsmith. Sharply bounded alternation within P. Submitted, http://www.cs.engr.uky.edu/¸goldsmit/main.ps.
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