2009 |
21 | EE | Stefan S. Dantchev,
Barnaby Martin,
Mark Rhodes:
Tight rank lower bounds for the Sherali-Adams proof system.
Theor. Comput. Sci. 410(21-23): 2054-2063 (2009) |
2008 |
20 | EE | Hajo Broersma,
Stefan S. Dantchev,
Matthew Johnson,
Stefan Szeider:
Preface.
J. Discrete Algorithms 6(4): 539 (2008) |
2007 |
19 | EE | Stefan S. Dantchev,
Barnaby Martin,
Stefan Szeider:
Parameterized Proof Complexity.
FOCS 2007: 150-160 |
18 | EE | Stefan S. Dantchev:
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.
STOC 2007: 311-317 |
17 | EE | Stefan S. Dantchev,
Barnaby Martin,
Stefan Szeider:
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.
Electronic Colloquium on Computational Complexity (ECCC) 14(001): (2007) |
16 | EE | Valentin E. Brimkov,
Stefan S. Dantchev:
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model.
Image Vision Comput. 25(10): 1631-1643 (2007) |
2006 |
15 | | Hajo Broersma,
Stefan S. Dantchev,
Matthew Johnson,
Stefan Szeider:
Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, UK
King's College, London 2006 |
14 | EE | Stefan S. Dantchev:
Relativisation Provides Natural Separations for Resolution-Based Proof Systems.
CSR 2006: 147-158 |
13 | EE | Stefan S. Dantchev,
Florent R. Madelaine:
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems.
CSR 2006: 159-170 |
12 | EE | Stefan S. Dantchev:
On the Complexity of the Sperner Lemma.
CiE 2006: 115-124 |
2005 |
11 | EE | Valentin E. Brimkov,
Stefan S. Dantchev:
Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension.
DGCI 2005: 287-298 |
10 | EE | Stefan S. Dantchev,
Frank D. Valencia:
On the computational limits of infinite satisfaction.
SAC 2005: 393-397 |
2003 |
9 | EE | Stefan S. Dantchev,
Søren Riis:
On Relativisation and Complexity Gap.
CSL 2003: 142-154 |
2002 |
8 | EE | Stefan S. Dantchev:
Resolution Width-Size Trade-offs for the Pigeon-Hole Principle.
IEEE Conference on Computational Complexity 2002: 39-43 |
7 | EE | Valentin E. Brimkov,
Stefan S. Dantchev:
An alternative to Ben-Or's lower bound for the knapsack problem complexity.
Appl. Math. Lett. 15(2): 187-191 (2002) |
2001 |
6 | | Stefan S. Dantchev,
Søren Riis:
"Planar" Tautologies Hard for Resolution.
FOCS 2001: 220-229 |
5 | EE | Stefan S. Dantchev,
Søren Riis:
Tree Resolution Proofs of the Weak Pigeon-Hole Principle.
IEEE Conference on Computational Complexity 2001: 69-75 |
2000 |
4 | EE | Valentin E. Brimkov,
Stefan S. Dantchev:
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model.
IFIP TCS 2000: 286-300 |
3 | EE | Valentin E. Brimkov,
Stefan S. Dantchev:
On the Algebraic Complexity of Integer Programming
Electronic Colloquium on Computational Complexity (ECCC) 7(17): (2000) |
1998 |
2 | EE | 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) 5(15): (1998) |
1997 |
1 | EE | Valentin E. Brimkov,
Stefan S. Dantchev:
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model.
J. Complexity 13(2): 279-300 (1997) |