Treffer: NP-completeness of k-connected hyperedge-replacement languages of order k
Title:
NP-completeness of k-connected hyperedge-replacement languages of order k
Authors:
Source:
Information processing letters. 45(2):89-94
Publisher Information:
Amsterdam: Elsevier Science, 1993.
Publication Year:
1993
Physical Description:
print, 9 ref
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, Théorie des langages et analyse syntaxique, Language theory and syntactical analysis, Complexité calcul, Computing complexity, Complejidad cálculo, Grammaire, Grammar, Gramática, Langage formel, Formal language, Lenguaje formal, NP-complétude, NP-completeness
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Bremen, fachbereich 3, W-2800 Bremen, Germany
ISSN:
0020-0190
Rights:
Copyright 1993 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.4753952
Database:
PASCAL Archive
Weitere Informationen
It is shown that hyperedge-replacement grammars of order k can generate NP-complete sets of k-connected graphs. This contrasts with the fact that, if hypergraphs containing only hyperedges of rank k are generated instead, this problem is known to be solvable in cubic time.