A. Woods. Bounded arithmetic formulas and Turing machines of constant alternation. In Logic Colloquium '84, pages 355--377. Elsevier, 1986. 20  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Time-Space Lower Bounds for Satisfiability - van Melkebeek (2001) (3 citations) (Correct)
....with random access to all tapes. See the paper by Fortnow and Van Melkebeek [FvM00] for details. We will not cover time space lower bounds for problems other than satisfiability, even though they may be based on similar techniques. Examples include problems higher up in the lineartime hierarchy [Woo86, FvM00] the polynomial time hierarchy [Kan84, Tou00] and the counting hierarchy [AKR 00] Time space lower bounds for problems that e#ciently reduce to satisfiability are relevant provided they have the property that each bit of the translation to satisfiability can be computed on the fly in ....
A. Woods. Bounded arithmetic formulas and Turing machines of constant alternation. In Logic Colloquium '84, pages 355--377. Elsevier, 1986. 20
The Computational Complexity Column - Fortnow (Correct)
....with random access to all tapes. See the paper by Fortnow and Van Melkebeek [FvM00] for details. We will not cover time space lower bounds for problems other than satis ability, even though they may be based on similar techniques. Examples include problems higher up in the lineartime hierarchy [Woo86, FvM00] the polynomial time hierarchy [Kan84, Tou00] and the counting hierarchy [AKR 00] Time space lower bounds for problems that eciently reduce to satis ability are relevant provided they have the property that each bit of the translation to satis ability can be computed on the y in a ....
A. Woods. Bounded arithmetic formulas and Turing machines of constant alternation. In Logic Colloquium '84, pages 355-377. Elsevier, 1986. 21
Complexity Doctrines - Otto, Jr. (1995) (4 citations) (Correct)
....characterize the linear time hierarchy relations (Section 1. 5) thus improving on [Wra78] By the way, on multi tape Turing machines, the linear time relations are not the N linear time relations [P 83, BDG90] and the linear time hierarchy relations are the bounded arithmetic relations [HP93, Woo86] We construct initial categories using almost equational specification based on two layers of restricted equational specification: sketches and orthogonality [Mak94, AR94, Bor94] Section 1.1, Appendices 1.A, 1.B) We have attempted (in this chapter) to be largely accessible to nonspecialists. ....
A. Woods. Bounded arithmetic formulas and Turing machines of constant alternation. In J. Paris, A. Wilkie, and G. Wilmers, editors, Logic Colloquium '84. North-Holland, 1986.
Time-Space Tradeoffs for Satisfiability - Fortnow (1997) (7 citations) (Correct)
....and showed that every set in NTISP[n O(1) n 1 Gammaffl ] is rudimentary. Wrathall [Wra78] later showed that the rudimentary sets are exactly Sigma LIN k . Kannan [Kan84] rediscovers Theorem 4.4 and shows that it holds for random access machines. Kannan [Kan84] and independently Woods [Woo86] generalize this theorem to show constant alternating polynomial time and n 1 Gammaffl space is contained in S k Sigma LIN k . Reischuk [Rei90, p. 282] gives an even broader generalization (Theorem 4.3) than our Lemma 4.2. For completeness, we give a proof of Lemma 4.2 below. Begin ....
A. Woods. Bounded arithmetic formulas and Turing machines of constant alternations. In Logic Colloquium '84, volume 120 of Studies in logic and the foundations of mathematics, pages 355--377. North-Holland, 1986.
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