论文信息 - A note on I-completeness of NP-witnessing relations

A note on I-completeness of NP-witnessing relations

In this note, we study under which conditions various sets (even easy ones) can be associated with a witnessing relation that is #P complete. We show a sufficient condition for an NP set to have such a relation. This condition applies also to many NP-complete sets, as well as to many sets in P.

Noam Livne

[1] A. Sorbi. complexity, logic, and recursion theory , 1997 .

[2] Mark W. Krentel. The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[3] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..

[4] Leslie G. Valiant,et al. The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6] Lane A. Hemaspaandra,et al. Witness-Isomorphic Reductions and Local Search , 1996 .