Universal Relations and #P-Completeness
This paper follows the methodology introduced by Agrawal and Biswas in [AB92], based on a notion of universality for the relations associated with NP-complete problems. The purpose was to study NP-complete problems by examining the effects of reductions on the solution sets of the associated witnessing relations. This provided a useful criterion for NP-completeness while suggesting structural similarities between natural NP-complete problems. We extend these ideas to the class #P. The notion we find also yields a practical criterion for #P-completeness, as illustrated by a varied set of examples, and strengthens the argument for structural homogeneity of natural complete problems.
KeywordsCandidate Solution Hamiltonian Cycle Hamiltonian Path Satisfying Assignment Universal Relation
Unable to display preview. Download preview PDF.
- [AB92]Agrawal, M., Biswas, S.: Universal relations. In: Structure in Complexity Theory Conference, pp. 207–220 (1992)Google Scholar
- [BDG88]Balcázar, J.L., Díaz, J., Gabarró, J.: Structural complexity 1. Springer, New York (1988)Google Scholar
- [BKT94]Buhrman, H., Kadin, J., Thierauf, T.: On functions computable with nonadaptive queries to NP. In: Structure in Complexity Theory Conference, pp. 43–52 (1994)Google Scholar
- [CK03]Chakravorty, G., Kumar, R.: #P universality. Technical report, Indian Institute of Technology (2003)Google Scholar
- [CSB04]Chaudhary, V., Sinha, A.K., Biswas, S.: Universality for nondeterministic logspace. In: Presented at Indo-German Workshop on Algorithms, Bangalore (2004)Google Scholar
- [Poi95]Poizat, B.: Les Petits Caillloux. Nur Al-Mantiq Wal-Ma’rifah, vol. 3. Aléas, Lyon (1995)Google Scholar