Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for phrase coNP-completeness (changed automatically) with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1997 (1) 1999 (1) 2000 (2) 2005 (1) 2006 (2)
Publication types (Num. hits)
article(2) inproceedings(5)
Venues (Conferences, Journals, ...)
ICALP(1) Int. J. Algebra Comput.(1) ISAAC(1) LICS(1) MFCS(1) RTA(1) Stud Logica(1)
Authors
Reinhard Pichler(2) Arnaud Durand 0001(1) Frank Wolter(1) Fritz Henglein(1) Harald Hempel(1) Jakob Rehof(1) Jean-Camille Birget(1) Laurent Juban(1) Michael Krüger(1) Miki Hermann(1) Tadeusz Litak(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 10 occurrences of 9 keywords
Results
Found 7 publication records. Showing 7 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
104Fritz Henglein, Jakob Rehof The Complexity of Subtype Entailment for Simple Types. Search on Bibsonomy LICS The full citation details ... 1997 DBLP  DOI  BibTeX  RDF subtype entailment complexity, atomic entailment, coNP-completeness, complexity-theoretic marker, exponential explosion, subtype inference, structural complexity bounds, computability, satisfiability, axiomatization, linear-time algorithm
85Michael Krüger, Harald Hempel Inverse HAMILTONIAN CYCLE and Inverse 3-D MATCHING Are coNP-Complete. Search on Bibsonomy ISAAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF coNP-completeness, inverse NP-problems, 3-DIMENSIONAL MATCHING, computational complexity, HAMILTONIAN CYCLE
66Arnaud Durand 0001, Miki Hermann, Laurent Juban On the Complexity of Recognizing the Hilbert Basis of a Linear Diophantine System. Search on Bibsonomy MFCS The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
54Tadeusz Litak, Frank Wolter All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete. Search on Bibsonomy Stud Logica The full citation details ... 2005 DBLP  DOI  BibTeX  RDF frame incompleteness, computational complexity, temporal logic, NP-completeness, tense logic
36Jean-Camille Birget Circuits, the Groups of Richard Thompson, and Conp-completeness. Search on Bibsonomy Int. J. Algebra Comput. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
18Reinhard Pichler Negation Elimination from Simple Equational Formulae. Search on Bibsonomy ICALP The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
18Reinhard Pichler The Explicit Representability of Implicit Generalizations. Search on Bibsonomy RTA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #7 of 7 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license