Stefan S. Dantchev

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 14

Top Topics

Binary Representation

Encoding Scheme

Top Venues

Electron. Colloquium Comput. Complex.

Ann. Pure Appl. Log.

Publications

Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Proof Complexity and the Binary Encoding of Combinatorial Principles. SIAM J. Comput. 53 (3) (2024)
Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Depth lower bounds in Stabbing Planes for combinatorial principles. Log. Methods Comput. Sci. 20 (1) (2024)
Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Depth Lower Bounds in Stabbing Planes for Combinatorial Principles. STACS (2022)
Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Depth lower bounds in Stabbing Planes for combinatorial principles. CoRR (2021)
Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Depth lower bounds in Stabbing Planes for combinatorial principles. Electron. Colloquium Comput. Complex. 28 (2021)
Stefan S. Dantchev, Nicola Galesi, Abdul Ghani, Barnaby Martin
Proof complexity and the binary encoding of combinatorial principles. CoRR (2020)
Stefan S. Dantchev, Abdul Ghani, Barnaby Martin
Sherali-Adams and the Binary Encoding of Combinatorial Principles. LATIN (2020)
Stefan S. Dantchev, Nicola Galesi, Barnaby Martin
Resolution and the Binary Encoding of Combinatorial Principles. Computational Complexity Conference (2019)
Stefan S. Dantchev, Abdul Ghani, Barnaby Martin
Sherali-Adams and the binary encoding of combinatorial principles. CoRR (2019)
Stefan S. Dantchev, Nicola Galesi, Barnaby Martin
Resolution and the binary encoding of combinatorial principles. CoRR (2018)
Stefan S. Dantchev, Nicola Galesi, Barnaby Martin
Resolution and the binary encoding of combinatorial principles. Electron. Colloquium Comput. Complex. 25 (2018)
Olaf Beyersdorff, Judith Clymo, Stefan S. Dantchev, Barnaby Martin
The Riis Complexity Gap for QBF Resolution. Electron. Colloquium Comput. Complex. 25 (2018)
Stefan S. Dantchev, Ioannis P. Ivrissimtzis
Simplicial Complex Entropy. CoRR (2016)
Stefan S. Dantchev, Ioannis P. Ivrissimtzis
Simplicial Complex Entropy. MMCS (2016)
Stefan S. Dantchev, Barnaby Martin
Relativization makes contradictions harder for Resolution. Ann. Pure Appl. Log. 165 (3) (2014)
Stefan S. Dantchev, Barnaby Martin
Relativisation makes contradictions harder for Resolution CoRR (2013)
Stefan S. Dantchev, Barnaby Martin
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. Comput. Complex. 22 (1) (2013)
Stefan S. Dantchev, Barnaby Martin
Parameterized Resolution with Bounded Conjunction. CSR (2013)
Stefan S. Dantchev, Barnaby Martin
The limits of tractability in Resolution-based propositional proof systems. Ann. Pure Appl. Log. 163 (6) (2012)
Stefan S. Dantchev, Ioannis P. Ivrissimtzis
Efficient construction of the Čech complex. Comput. Graph. 36 (6) (2012)
Stefan S. Dantchev, Barnaby Martin
Cutting Planes and the Parameter Cutwidth. Theory Comput. Syst. 51 (1) (2012)
Stefan S. Dantchev, Barnaby Martin
Parameterized Resolution with bounded conjunction CoRR (2012)
Stefan S. Dantchev
Dynamic Neighbourhood Cellular Automata. Comput. J. 54 (1) (2011)
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
Sublinear-time algorithms for tournament graphs. J. Comb. Optim. 22 (3) (2011)
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
Parameterized Proof Complexity. Comput. Complex. 20 (1) (2011)
Stefan S. Dantchev, Barnaby Martin
The Limits of Tractability in Resolution-Based Propositional Proof Systems. CiE (2010)
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Editorial. J. Discrete Algorithms 8 (2) (2010)
Stefan S. Dantchev, Tom Friedetzky, Lars Nagel
Sublinear-Time Algorithms for Tournament Graphs. COCOON (2009)
Stefan S. Dantchev, Barnaby Martin
Cutting Planes and the Parameter Cutwidth. CiE (2009)
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Editorial. J. Discrete Algorithms 7 (2) (2009)
Stefan S. Dantchev, Barnaby Martin, Mark Nicholas Charles Rhodes
Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. 410 (21-23) (2009)
Hajo Broersma, Stefan S. Dantchev, Matthew Johnson, Stefan Szeider
Preface. J. Discrete Algorithms 6 (4) (2008)
Stefan S. Dantchev
Dynamic Neighbourhood Cellular Automata. BCS Int. Acad. Conf. (2008)
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
Parameterized Proof Complexity. FOCS (2007)
Valentin E. Brimkov, Stefan S. Dantchev
Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. Image Vis. Comput. 25 (10) (2007)
Stefan S. Dantchev
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. STOC (2007)
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. Electron. Colloquium Comput. Complex. 14 (001) (2007)
Stefan S. Dantchev, Florent R. Madelaine
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. CSR (2006)
Stefan S. Dantchev
On the Complexity of the Sperner Lemma. CiE (2006)
Stefan S. Dantchev
Relativisation Provides Natural Separations for Resolution-Based Proof Systems. CSR (2006)
Stefan S. Dantchev, Frank D. Valencia
On the computational limits of infinite satisfaction. SAC (2005)
Valentin E. Brimkov, Stefan S. Dantchev
Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. DGCI (2005)
Stefan S. Dantchev, Søren Riis
On Relativisation and Complexity Gap. CSL (2003)
Stefan S. Dantchev
Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. Computational Complexity Conference (2002)
Valentin E. Brimkov, Stefan S. Dantchev
An alternative to Ben-Or's lower bound for the knapsack problem complexity. Appl. Math. Lett. 15 (2) (2002)
Stefan S. Dantchev
Improved sorting-based procedure for integer programming. Math. Program. 92 (2) (2002)
Stefan S. Dantchev, Søren Riis
Tree Resolution Proofs of the Weak Pigeon-Hole Principle. Computational Complexity Conference (2001)
Stefan S. Dantchev, Søren Riis
"Planar" Tautologies Hard for Resolution. FOCS (2001)
Valentin E. Brimkov, Stefan S. Dantchev
On the Algebraic Complexity of Integer Programming Electron. Colloquium Comput. Complex. 7 (17) (2000)
Valentin E. Brimkov, Stefan S. Dantchev
On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. IFIP TCS (2000)
Valentin E. Brimkov, Stefan S. Dantchev
Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients Electron. Colloquium Comput. Complex. 5 (15) (1998)
Valentin E. Brimkov, Stefan S. Dantchev
Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. J. Complex. 13 (2) (1997)