|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 20 occurrences of 18 keywords
|
|
|
|
|
Results
Found 34 publication records. Showing 34 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Stefan S. Dantchev, Barnaby Martin |
The limits of tractability in Resolution-based propositional proof systems.  |
Ann. Pure Appl. Logic  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin |
Parameterized Resolution with bounded conjunction |
CoRR |
2012 |
DBLP BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin |
Cutting Planes and the Parameter Cutwidth. |
Theory Comput. Syst. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Tom Friedetzky, Lars Nagel |
Sublinear-time algorithms for tournament graphs. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev |
Dynamic Neighbourhood Cellular Automata. |
Comput. J. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
Parameterized Proof Complexity. |
Computational Complexity |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Editorial. |
J. Discrete Algorithms |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin |
The Limits of Tractability in Resolution-Based Propositional Proof Systems. |
CiE |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin, Mark Nicholas Charles Rhodes |
Tight rank lower bounds for the Sherali-Adams proof system. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Editorial. |
J. Discrete Algorithms |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Tom Friedetzky, Lars Nagel |
Sublinear-Time Algorithms for Tournament Graphs. |
COCOON |
2009 |
DBLP DOI BibTeX RDF |
random walk, tournament, sublinear-time algorithms |
| 1 | Stefan S. Dantchev, Barnaby Martin |
Cutting Planes and the Parameter Cutwidth. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider |
Preface. |
J. Discrete Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev |
Dynamic Neighbourhood Cellular Automata. |
BCS Int. Acad. Conf. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. |
Image Vision Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Barnaby Martin, Stefan Szeider |
Parameterized Proof Complexity. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev |
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
Lovász-Schrijver proof system, complexity gap theorems, lift and project methods, lower bounds, propositional proof complexity |
| 1 | Stefan S. Dantchev, Florent R. Madelaine |
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
Constraint Satisfaction, Duality, Monadic Second Order Logic, Logic in Computer Science, Graph Homomorphism |
| 1 | Stefan S. Dantchev |
Relativisation Provides Natural Separations for Resolution-Based Proof Systems. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hajo Broersma, Stefan S. Dantchev, Matthew Johnson 0002, Stefan Szeider (eds.) |
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK |
ACiD |
2006 |
DBLP BibTeX RDF |
|
| 1 | Stefan S. Dantchev |
On the Complexity of the Sperner Lemma. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Frank D. Valencia |
On the computational limits of infinite satisfaction. |
SAC |
2005 |
DBLP DOI BibTeX RDF |
infinite CSP, open CSP, decidability, constraint satisfaction problems |
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. |
DGCI |
2005 |
DBLP DOI BibTeX RDF |
digital plane recognition, integer programming, Digital hyperplane |
| 1 | Stefan S. Dantchev, Søren Riis |
On Relativisation and Complexity Gap. |
CSL |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
An alternative to Ben-Or's lower bound for the knapsack problem complexity. |
Appl. Math. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev |
Improved sorting-based procedure for integer programming. |
Math. Program. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev |
Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. (PDF / PS) |
IEEE Conference on Computational Complexity |
2002 |
DBLP DOI BibTeX RDF |
Pigeon-Hole Principle, Width-Size trade-off, Resolution, Propositional Proof Complexity |
| 1 | Stefan S. Dantchev, Søren Riis |
"Planar" Tautologies Hard for Resolution. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan S. Dantchev, Søren Riis |
Tree Resolution Proofs of the Weak Pigeon-Hole Principle. (PDF / PS) |
IEEE Conference on Computational Complexity |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
On the Algebraic Complexity of Integer Programming |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. |
IFIP TCS |
2000 |
DBLP DOI BibTeX RDF |
Integer programming, Knapsack problem, Algebraic complexity, Complexity bounds |
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Valentin E. Brimkov, Stefan S. Dantchev |
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. |
J. Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #34 of 34 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")