Treffer: #3-rgular bipartite planar vertex cover is #P-complete
Title:
#3-rgular bipartite planar vertex cover is #P-complete
Authors:
Source:
Theory and applications of models of computation (Third international conference, TAMC 2006, Beijing, China, May 15-20, 2006)Lecture notes in computer science. :356-364
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 7 ref 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, Graphe régulier, Regular graph, Grafo regular, Interpolation polynomiale, Polynomial interpolation, Interpolación polinomial, Méthode polynomiale, Polynomial method, Método polinomial, Recouvrement graphe, Graph covering, Cubierta grafo, Récurrence, Recurrence, Recurrencia
Document Type:
Konferenz
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Graduate University of Chinese Academy of Sciences, Beijing, China
Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing 100080, China
Institute of Software, Chinese Academy of Sciences, P.O. Box 8717, Beijing 100080, China
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.19688425
Database:
PASCAL Archive
Weitere Informationen
We generalize the polynomial interpolation method by giving a sufficient condition, which guarantees that the coefficients of a polynomial are uniquely determined by its values on a recurrence sequence. Using this method, we show that #3-Regular Bipartite Planar Vertex Cover is #P-complete. The result is unexpected, since the same question for 2-regular graph is in FP.