Result: Universal relations and #P-completeness
Title:
Universal relations and #P-completeness
Authors:
Source:
Algorithms and complexity (6th Italian conference, CIAC 2006, Rome, Italy, May 29-31, 2006)0CIAC 2006. :368-379
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 1/4 p 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithme, Algorithm, Algoritmo, Complexité calcul, Computational complexity, Complejidad computación, Homogénéité, Homogeneity, Homogeneidad, Problème NP complet, NP complete problem, Problema NP completo, Similitude, Similarity, Similitud
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Laboratoire PRiSM, Université de Versailles St-Quentin en Yvelines, France
Laboratory of Prof. Masahiko SATO, Graduate School of Informatics, Kyoto University, Japan
Laboratory of Prof. Masahiko SATO, Graduate School of Informatics, Kyoto University, Japan
ISSN:
0302-9743
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19150325
Database:
PASCAL Archive
Further Information
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.