Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

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

Publication years (Num. hits)
1981-2009 (13)
Publication types (Num. hits)
article(3) inproceedings(10)
Venues (Conferences, Journals, ...)
CADE(2) ACM Southeast Regional Confere...(1) CAAP(1) CCC(1) EUROCAST(1) ISMIS(1) ISSAC(1) LICS(1) Reports Math. Log.(1) Soft Comput.(1) Theor. Comput. Sci.(1) WG(1)
Authors
Bertrand I-Peng Lin(1) Churn-Jung Liau(1) D. Sivakumar 0001(1) Dagmar Handke(1) Dexter Kozen(1) Hubert Comon(1) Igor Romanenko(1) Jennifer Widom(1) José Antonio Muñoz-Blanco(1) Juan Carlos Quevedo-Losada(1) Konstantin Vershinin(1) Olga Bolívar Toledo(1) Omar Hammami(1) Paulin Jacobé de Naurois(1) Philippe Codognet(1) Prakash Panangaden(1) More (+10 of total 22)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 6 occurrences of 6 keywords
Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
37Takahiro Seki Completness of relevant modal logics with disjunctive rules. Search on Bibsonomy Reports Math. Log. The full citation details ... 2009 DBLP  BibTeX  RDF
37Ulrik Brandes, Dagmar Handke NP-Completness Results for Minimum Planar Spanners. Search on Bibsonomy WG The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
37Jennifer Widom, Prakash Panangaden Expressiveness Bounds for Completness in Trace-Based Network Proof Systems. Search on Bibsonomy CAAP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
37Hubert Comon Sufficient Completness, Term Rewriting Systems and "Anti-Unification". Search on Bibsonomy CADE The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
37Dexter Kozen, Rohit Parikh An Elementary Proof of the Completness of PDL. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1981 DBLP  DOI  BibTeX  RDF
33Paulin Jacobé de Naurois, Virgile Mogbil Correctness of Multiplicative Additive Proof Structures is NL-Complete. Search on Bibsonomy LICS The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Correctness Criterion, Multiplicative Additive Linear Logic, NL-completness, Computational Complexity, proof-nets
33Ravi Kumar 0001, D. Sivakumar 0001 A Note on the Shortest Lattice Vector Problem. Search on Bibsonomy CCC The full citation details ... 1999 DBLP  DOI  BibTeX  RDF shortest lattice vector, NP-completness, uniqueness
25Zdenka Riecanová Sub-effect algebras and Boolean sub-effect algebras. Search on Bibsonomy Soft Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Sub-effect algebra, Boolean sub-effect algebra, Complete effect algebra, Blocks, Effect algebra
25Omar Hammami Fighting space complexity of compile time cache management schemes. Search on Bibsonomy ACM Southeast Regional Conference The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
25Churn-Jung Liau, Bertrand I-Peng Lin Reasoning about Higher Order Uncertainty in Possiblistic Logic. Search on Bibsonomy ISMIS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
25José Antonio Muñoz-Blanco, Juan Carlos Quevedo-Losada, Olga Bolívar Toledo The Role of Partitions and Functionals in Descriptor Computation for Data Receptive Fields. Search on Bibsonomy EUROCAST The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
25Konstantin Vershinin, Igor Romanenko One More Logic with Uncertainty and Resolution Principle for it. Search on Bibsonomy CADE The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
25Philippe Codognet Equations, Disequations and Unsolvable Subsets (abstract). Search on Bibsonomy ISSAC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (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