By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Buss, S.R. ; Dept. of Math., California Univ., Berkeley, CA, USA ; Hay, L.

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 Δp/2, and an oracle separating Δp/2 from the class of predicates polynomial time truth-table reducible to SAT is given

Published in:

Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual

Date of Conference:

14-17 Jun 1988