This abstract presents in brief form the authors' work on generalized Boolean hierarchies and Boolean hierarchies over RP. [BBJSY 89] contains a complete presentation of this work, and copies will be available at the conference and at the University of Wisconsin address below. This work was supported in part by the Ministero della Pubblica Istruzione, through “Progetto 40%: Algoritmi e Strutture di Calcolo,” the National Science Foundation under grant DCR-8402375, and by the Wisconsin Alumni Research Foundation under a Brittingham Visiting Professorship. The last four authors' 1988–89 address is: Computer Sciences Department, University of Wisconsin, 1210 West Dayton St., Madison, WI 53706, U.S.A.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. Bibliography
J. Addison, “The method of alternating chains,” Symp Theor Models, North-Holland, (1965), 1–16.
L. Adleman and M. A. Huang, “Recognizing primes in random polynomial time,” ACM Symp Theory Computing, (1987), 462–469.
E. Bach, G. Miller and J. Shallit, “Sums of divisors, perfect numbers and factoring,” SIAM J Computing, 15, (1986), 1143–1154.
T. Baker, J. Gill and R. Solovay, “Relativizations of the P = NP question,” SIAM J Computing, 4 (1975), 431–442.
R. Beigel, “Bounded queries to SAT and the Boolean hierarchy,” preprint, (1987).
R. Beigel, L. Hemachandra and G. Wechsung, “On the power of probabilistic polynomial time: P N P[log] \( \subseteq \) PP,” Structure on Complexity Conference, (1989), to appear.
C. Bennet and J. Gill, “Relative to a random oracle A, P A ≠ NP A ≠ coNP A with probability one,” SIAM J Computing, 10 (1981), 96–113.
A. Bertoni, D. Bruschi, D. Joseph, M. Sitharam and P. Young, “Generalized Boolean hierarchies and Boolean hierarchies over RP,” Univ Wisconsin, CS Dept Tech Report, 809 (1989), 1–50.
D. Bruschi, D. Joseph and P. Young, “Strong separations for the Boolean hierarchy over RP,” Univ Wisconsin, CS Dept Tech Report, 847 (1989), 1–12.
S.Buss and L. Hay, “On truth-table reducibility to SAT and the difference hierarchy,” Structure in Complexity Conference, (1988), 224–233.
J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung, “The Boolean hiearchy I: structural properties,” SIAM J Comput, 6 (1988), 1232–1252.
J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung, “The Boolean hiearchy II: applications,” SIAM J Comput, 7 (1989), 95–111.
J. Cai and L. Hemachandra, “The Boolean hierarchy: hardware over NP,” Structure in Complexity Conference, (1986), 105–124.
Y. Ershov, “A hierarchy of sets, I,” Algebra and Logic, 7 (1968), 25–43.
Y. Ershov, “A hierarchy of sets, II,” Algebra and Logic, 7 (1968), 15–47.
Y. Ershov, “A hierarchy of sets, III,” Algebra and Logic, 9 (1969), 20–31.
J. Geske and J. Grollmann, “Relativizations of unambiguous and random polynomial time classes,” SIAM J Computing, 15 (1986), 511–519.
T. Gundermann and G. Wechsung, “Nondeterministic Turing machines with modified acceptance,” Proc MFCS, L N CS, 233 (1986), 396–404.
F. Hausdorff, Set Theory, Chelsea, 3rd ed., 1978.
P. Hinman and S. Zachos, “Probabilistic machines, oracles and quantifiers,” Proc. Recursion Theory Week, L. N. Math. 1141 (1984), 159–192.
J. Kadin, “The polynomial time hierarchy collapses if the Boolean hierarchy collapses,” Structure in Complexity Conference, (1988), 278–292.
J. Köbler, U. Schöning and K. Wagner, “The difference and truth-table hierarchies for NP,” RAIRO, 21 (1987), 419–435.
K. Ko, “Some observations on probabilistic algorithms and NP-hard problems,” Inform Proc Letters, 14 (1982), 39–43.
C. Lautemann, “BPP and the polynomial hierarchy,” Inform Proc Letters, 17 (1983), 215–217.
H. Putnam, “Trial and error predicates and a solution to a problem of Mostowski,” J Sym Logic, 30 (1965), 49–57.
M. Rabin, “Probabilistic tests for primality,” J Number Theory, 12 (1980), 128–138.
M. Rabin and J. Shallit, “Randomized algorithms in number theory,” To appear Comm Pure Appl Math.
C. Rackoff, “Relativized questions involving probabilistic algorithms,” JACM, 29 (1982), 261–268.
J. Schwartz, “Fast probabilistic algorithms for the verification of polynomial identities,” JACM, 27 (1980), 701–717.
M. Sipser, “A complexity theoretic approach to randomness,” Proc Symp Theory Comput, (1983), 330–335.
R. Solovay and V. Strassen, “A fast Monte-Carlo test for primality,” SIAM J Comput 6 (1977), 84–85; [Erratum: 7 (1978), 118].
K. Wagner, “More complicated questions about maxima and minima, and some closure properties of NP,” ICALP, L N Comp Sc, 226 (1986), 434–443.
K. Wagner, “Bounded query computations,” Structure in Complexity Conference, (1988), 260–277.
G. Wechsung and K. Wagner, “On the Boolean closure of NP,” Proc Conf Fundament Comput Theory, L N Comp Sc, 199 (1985), 485–493.
S. Zachos and H. Heller, “A decisive characterization of BPP,” Information and Control, 69 (1986), 125–135.
S. Zachos, “Probabilistic quantifiers, adversaries and complexity classes: an overview,” Structure in Complexity Conference, (1986), 383–400.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertoni, A., Bruschi, D., Joseph, D., Sitharam, M., Young, P. (1989). Generalized Boolean hierarchies and Boolean hierarchies over RP. In: Csirik, J., Demetrovics, J., Gécseg, F. (eds) Fundamentals of Computation Theory. FCT 1989. Lecture Notes in Computer Science, vol 380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51498-8_4
Download citation
DOI: https://doi.org/10.1007/3-540-51498-8_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51498-5
Online ISBN: 978-3-540-48180-5
eBook Packages: Springer Book Archive