|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 2 occurrences of 2 keywords
|
|
|
|
|
Results
Found 20 publication records. Showing 20 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Christian Glaßer, Aduri Pavan, Stephen D. Travers |
The fault tolerance of NP-hard problems.  |
Inf. Comput.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers |
Unions of Disjoint NP-Complete Sets. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr |
Equivalence Problems for Circuits over Sets of Natural Numbers. |
Theory Comput. Syst. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr |
Satisfiability of algebraic circuits over sets of natural numbers. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang |
Non-mitotic sets. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Stephen D. Travers |
Machines that Can Output Empty Words. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Leaf languages, Gap theorems, Computational complexity, Polynomial-time hierarchy |
| 1 | Christian Glaßer, Aduri Pavan, Stephen D. Travers |
The Fault Tolerance of NP-Hard Problems. |
LATA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
The complexity of unions of disjoint sets. |
J. Comput. Syst. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr |
Equivalence Problems for Circuits over Sets of Natural Numbers. |
CSR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
The Complexity of Unions of Disjoint Sets. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang |
Non-mitotic Sets. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr |
Satisfiability of Algebraic Circuits over Sets of Natural Numbers. |
FSTTCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang |
Non-Mitotic Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner |
The Complexity of Unions of Disjoint Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stephen D. Travers |
The complexity of membership problems for circuits over sets of integers. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Stephen D. Travers |
Machines that Can Output Empty Words. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Stephen D. Travers, Klaus W. Wagner |
Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. |
Developments in Language Theory |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christian Glaßer, Stephen D. Travers |
Machines that can Output Empty Words |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Christian Glaßer, Stephen D. Travers, Klaus W. Wagner |
A Reducibility that Corresponds to Unbalanced Leaf-Language Classes |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Stephen D. Travers |
The Complexity of Membership Problems for Circuits over Sets of Integers. |
MFCS |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #20 of 20 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")