|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 18 occurrences of 16 keywords
|
|
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 75 | Fritz Henglein, Jakob Rehof |
The Complexity of Subtype Entailment for Simple Types.  |
LICS  |
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 |
| 63 | Edith Hemaspaandra, Gerd Wechsung |
The Minimization Problem for Boolean Formulas. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
computational complexity, minimization, propositional logic, Boolean formulas, polynomial hierarchy |
| 46 | Michael Bauland, Edith Hemaspaandra |
Isomorphic Implication. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Computational complexity, Constraints, Propositional logic, Logic in computer science, Isomorphism problem |
| 46 | Michael Bauland, Edith Hemaspaandra |
Isomorphic Implication. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 40 | Hans Raj Tiwary |
On the hardness of minkowski addition and related operations. |
SCG |
2007 |
DBLP DOI BibTeX RDF |
coNP-hardness, extended convex hull, polytope intersection, computational geometry, polytopes, turing reduction, minkowski addition |
| 36 | Shun'ichi Amano |
On the coNP hardness of computing certain answers over locally specified incomplete DOM-trees. |
Inf. Process. Lett. |
2010 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license