A note on #P-completeness of NP-witnessing relations

Authors:
Noam Livne
Affiliations:
Department of Computer Science and Applied Mathematics, Weizmann Institute of Science, Rehovot, Israel
Venue:
Information Processing Letters
Year:
2009

Citing 2
Cited 0

The complexity of optimization problems

Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
On isomorphisms and density of NP and other complete sets

STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.89

Visualization

Abstract

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.