J.F. Buss, "Relativized Alternation and Space-Bounded Computation," J. Comput. System Sci. 36 (1988) 351--378. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Oracles versus Proof Techniques that Do Not Relativize - Allender (1990) (6 citations) (Correct)
....the opinion that the real issue centers on the question of what is the correct way to provide machines such as alternating Turing machines with access to the oracle. Alternative oracle access mechanisms have been presented for space bounded Turing machines [Wi 88] and alternating Turing machines [Bu 88] that have the virtue of allowing most of the standard characterizations to hold relative to all oracles. A more general mechanism along the same lines was presented in [Bu 87] The virtues and drawbacks of the various oracle access mechanisms have been debated in several di#erent settings in a ....
J. Buss, Relativized alternation and space-bounded computation, J. Comput. and System Sci. 36, 351--378.
Fixed Point Logics, Generalized Quantifiers, and Oracles - Imhof (1995) (Correct)
....) j LOGSPACE NP . Hence, as QMC is contained in this class, we find that FO(QMC ; QHAM ) j IFP(QHAM ) holds on ordered structures if and only if LOGSPACE NP j PTIME NP . To avoid any assumptions on complexity classes, we apply a diagonal argument, which is essentially due to J.F. Buss [1]. It was pointed out to the author by Y. Pnueli that this method might be useful in the context of fixed point logic. In the following, let = fg, and consider only structures A ordered by A . A n will denote an ordering (A n ; where A n has n elements. The oracle Q will be a class of oe ....
J.F. Buss. Relativized alternation and space-bounded computation. Journal of Computer and System Sciences, 36:351--378, 1988.
Relativized Logspace and Generalized Quantifiers over Finite.. - Gottlob (1997) (17 citations) (Correct)
....here. However, they encountered difficulties with quantifier nesting (precisely the type of difficulties with nesting we alluded to earlier in this section) and had to depart from the usual notion of oracle machine and to switch to models of oracle machines such as those described by Buss [3] having several oracletapes. In the usual Ladner Lynch model [23] which is adopted in the present paper, an oracle machine has a unique oracle tape. They succeeded to show deep and interesting results for relativized complexity classes defined under the different oracle model. In particular, they ....
....at least two oracle tapes are available, then T ffi C can be easily decided by an L C acceptor: use one oracle tape for the queries made by T and another oracle tape for the query corresponding to C. The oracle machine model used by Makowsky and Pnueli is identical to the unbounded model by Buss [3], except that the number of oracle tapes is bounded by a constant. Their model is also equivalent to the stack oracle model of Wilson [39] where the number of oracle tapes in the stack is bounded by a constant. In the rest of this section, we give a formal proof that (under the standard ....
J. Buss. Relativized Alternation and SpaceBounded Computation. Journal of Computer and System Sciences, vol. 36, pp. 351--378, 1988.
Sharply Bounded Alternation within P - Bloch (1995) (2 citations) Self-citation (Buss) (Correct)
No context found.
J.F. Buss, "Relativized Alternation and Space-Bounded Computation," J. Comput. System Sci. 36 (1988) 351--378.
Sharply Bounded Alternation within P - Bloch, Buss, Goldsmith (1996) (2 citations) Self-citation (Buss) (Correct)
No context found.
J.F. Buss, "Relativized Alternation and Space-Bounded Computation," J. Comput. System Sci. 36 (1988) 351--378.
Sharply Bounded Alternation and Quasilinear Time - Bloch, Buss, Goldsmith (1997) Self-citation (Buss) (Correct)
....bound of an LATM is found by maximizing the length of all its branches, any linear or quasilinear time bound we impose will naturally apply to both the deterministic and length alternating parts. 5 One of the authors has previously used this self query model for an entirely different purpose [11]. We do not suggest any meaningful connection between the present use and the earlier one. With these restrictions, a self querying LATM M using quasilinear time behaves essentially as a deterministic quasilinear time oracle machine with an oracle in SBH (QL) and thus computes a function in ....
J.F. Buss, "Relativized Alternation and Space-Bounded Computation," J. Comput. System Sci. 36 (1988) 351--378.
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