On truth-table reducibility to SAT and the difference hierarchy over NP

It is shown that polynomial-time truth-table reducibility by Boolean circuits to SAT is the same as log-space truth-table reducibility via Boolean formulas to SAT and the same as log-space Turing reducibility to SAT. It is proved that a constant number of rounds of parallel queries to SAT is equivalent to one round of parallel queries. It is shown that the infinite difference hierarchy over NP is equal to Delta p/2, and an oracle separating Delta p/2 from the class of predicates polynomial time truth-table reducible to SAT is given.<<ETX>>

[1]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[2]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[3]  Klaus W. Wagner,et al.  The Difference and Truth-Table Hierarchies for NP , 1987, RAIRO Theor. Informatics Appl..

[4]  L. Hay,et al.  Small recursive ordinals, many-one degrees, and the arithmetical difference hierarchy , 1975 .

[5]  Jin-Yi Cai,et al.  The Boolean Hierarchy: Hardware over NP , 1986, SCT.

[6]  Nancy A. Lynch,et al.  Comparison of polynomial-time reducibilities , 1974, STOC '74.

[7]  Mihalis Yannakakis,et al.  The complexity of facets (and some facets of complexity) , 1982, STOC '82.

[8]  Hilary Putnam,et al.  Trial and error predicates and the solution to a problem of Mostowski , 1965, Journal of Symbolic Logic.

[9]  R. Epstein,et al.  Hierarchies of sets and degrees below 0 , 1981 .

[10]  Klaus W. Wagner,et al.  Bounded Query Classes , 1990, SIAM J. Comput..

[11]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[12]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[13]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[14]  Judy Goldsmith,et al.  Three results on the polynomial isomorphism of complete sets , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  William I. Gasarch,et al.  Bounded query classes and the difference hierarchy , 1989, Arch. Math. Log..

[16]  R.E. Ladner,et al.  A Comparison of Polynomial Time Reducibilities , 1975, Theor. Comput. Sci..

[17]  Louise Hay,et al.  Index Sets Universal for Differences of Arithmetic Sets , 1974 .

[18]  Gerd Wechsung,et al.  On the Boolean closure of NP , 1985, FCT.