Restricted information from nonadaptive queries to NP

Author

Han, Yenjo ; Thierauf, Thomas

Author_Institution

Dept. of Comput. Sci., Rochester Univ., NY, USA

fYear

1995

fDate

19-22 Jun 1995

Firstpage

206

Lastpage

213

Abstract

We investigate classes of sets that can be decided by bounded truth-table reductions to an NP set in which evaluators do not have full access to the answers to the queries but get only restricted information such as the number of queries that are in the oracle set or even just this number modulo m, for some m⩾2. We also investigate the case in which evaluators are nondeterministic. We locate all these classes within levels of the Boolean hierarchy, which allows us to compare the complexity of such classes. Our results show the various degrees to which the power of P or NP evaluators are affected as the restricted information that the evaluators get from the answers to the queries produced by generators is changed

Keywords

Boolean functions; computational complexity; decidability; set theory; Boolean hierarchy; NP set; bounded truth-table reduction; complexity; decidability; evaluators; generators; nonadaptive queries; nondeterministic evaluators; oracle set; restricted information; set classes; Complexity theory; Computer science;

fLanguage

English

Publisher

ieee

Conference_Titel

Structure in Complexity Theory Conference, 1995., Proceedings of Tenth Annual IEEE

Conference_Location

Minneapolis, MN

ISSN

1063-6870

Print_ISBN

0-8186-7052-5

Type

conf

DOI

10.1109/SCT.1995.514859

Filename

514859