NDLI: On functions computable with nonadaptive queries to NP

Content Provider	IEEE Xplore Digital Library
Author	Buhrman, H. Kadin, J. Thierauf, T.
Copyright Year	1994
Description	Author affiliation: Dept. de Llenguatges i Sistemes Inf., Univ. Politecnica de Catalunya, Barcelona, Spain (Buhrman, H.)
Abstract	We study FP/sub /spl par/sup NP/, the class of functions that can be computed with nonadaptive queries to an NP oracle. We show that optimization problems stemming from the known NP complete sets, where the optimum is taken over a polynomially bounded range, are hard for FP/sub /spl par/sup NP/. This is related to (and, in some sense, extends) work of Z. Chen and S. Toda (1991). In addition, it turns out that these optimization problems are all equivalent under a certain functional reducibility. By studying the question whether these function classes are complete for FP/sub /spl par/sup NP/, i.e. whether it is possible to compute an optimal value for a given optimization problem in FP/sub /spl par/sup NP/, we show that this is exactly as hard as to compute membership proofs for NP complete sets in FP/sub /spl par/sup NP/. On the other hand, FP/sub /spl par/sup NP/ can be characterized as the class of functions that reduces to the above mentioned optimization functions. We call this property quasi-completeness. A subclass of FP/sub /spl par/sup NP/ is NPSV, the class of functions that can be computed by single-valued NP transducers, We exhibit function classes that are quasi-complete for NPSV but not complete unless the polynomial time hierarchy collapses.
Starting Page	43
Ending Page	52
File Size	885375
Page Count	10
File Format	PDF
ISBN	0818656700
DOI	10.1109/SCT.1994.315819
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1994-06-28
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Polynomials Computer science Transducers Postal services Contracts
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Functions computable with nonadaptive queries to np (1994).

Computing functions with parallel queries to NP

A note on p-selective sets and on adaptive versus nonadaptive queries to NP

On functions computable with nonadaptive queries to np (1994).

Restricted information from nonadaptive queries to NP

Verifiable random functions

Advice from nonadaptive queries to np (1993).

Complements of multivalued functions

On P-selective Sets and Adaptive versus Nonadaptive Queries to Np

On functions computable with nonadaptive queries to NP

Similar Documents

Functions computable with nonadaptive queries to np (1994).

Computing functions with parallel queries to NP

A note on p-selective sets and on adaptive versus nonadaptive queries to NP

On functions computable with nonadaptive queries to np (1994).

Restricted information from nonadaptive queries to NP

Verifiable random functions

Advice from nonadaptive queries to np (1993).

Complements of multivalued functions

On P-selective Sets and Adaptive versus Nonadaptive Queries to Np

On functions computable with nonadaptive queries to NP