E-LIB Suche - Ergebnisse für: Dantchev, Stefan

1

Proof Complexity and the Binary Encoding of Combinatorial P..:

Dantchev, Stefan ; Galesi, Nicola ; Ghani, Abdul.
SIAM Journal on Computing. 53 (2024) 3 - p. 764-802 , 2024

Link: https://doi.org/10.1137/..

2

Relativization makes contradictions harder for Resolution:

Dantchev, Stefan ; Martin, Barnaby
Annals of Pure and Applied Logic. 165 (2014) 3 - p. 837-857 , 2014

Link: https://doi.org/10.1016/..

3

Efficient construction of the Čech complex:

Dantchev, Stefan ; Ivrissimtzis, Ioannis
Computers & Graphics. 36 (2012) 6 - p. 708-713 , 2012

Link: https://doi.org/10.1016/..

4

The limits of tractability in Resolution-based propositiona..:

Dantchev, Stefan ; Martin, Barnaby
Annals of Pure and Applied Logic. 163 (2012) 6 - p. 656-668 , 2012

Link: https://doi.org/10.1016/..

5

Rank complexity gap for Lovász-Schrijver and Sherali-Adams ..:

Dantchev, Stefan ; Martin, Barnaby
computational complexity. 22 (2012) 1 - p. 191-213 , 2012

Link: https://doi.org/10.1007/..

6

Cutting Planes and the Parameter Cutwidth:

Dantchev, Stefan ; Martin, Barnaby
Theory of Computing Systems. 51 (2011) 1 - p. 50-64 , 2011

Link: https://doi.org/10.1007/..

7

Parameterized Proof Complexity:

Dantchev, Stefan ; Martin, Barnaby ; Szeider, Stefan
computational complexity. 20 (2011) 1 - p. 51-85 , 2011

Link: https://doi.org/10.1007/..

8

Editorial:

Broersma, Hajo ; Dantchev, Stefan ; Johnson, Matthew.
Journal of Discrete Algorithms. 8 (2010) 2 - p. 101 , 2010

Link: https://doi.org/10.1016/..

9

Sublinear-time algorithms for tournament graphs:

Dantchev, Stefan ; Friedetzky, Tom ; Nagel, Lars
Journal of Combinatorial Optimization. 22 (2010) 3 - p. 469-481 , 2010

Link: https://doi.org/10.1007/..

10

Tight rank lower bounds for the Sherali–Adams proof system:

Dantchev, Stefan ; Martin, Barnaby ; Rhodes, Mark
Theoretical Computer Science. 410 (2009) 21-23 - p. 2054-2063 , 2009

Link: https://doi.org/10.1016/..

11

Editorial:

Broersma, Hajo ; Dantchev, Stefan ; Johnson, Matthew.
Journal of Discrete Algorithms. 7 (2009) 2 - p. 147 , 2009

Link: https://doi.org/10.1016/..

12

Preface:

Broersma, Hajo ; Dantchev, Stefan ; Johnson, Matthew.
Journal of Discrete Algorithms. 6 (2008) 4 - p. 539 , 2008

Link: https://doi.org/10.1016/..

13

Digital hyperplane recognition in arbitrary fixed dimension..:

Brimkov, Valentin E. ; Dantchev, Stefan
Image and Vision Computing. 25 (2007) 10 - p. 1631-1643 , 2007

Link: https://doi.org/10.1016/..

14

Improved sorting-based procedure for integer programming:

Dantchev, Stefan
Mathematical Programming. 92 (2002) 2 - p. 297-300 , 2002

Link: https://doi.org/10.1007/..

15

Tight complexity bounds for the two-dimensional real knapsa..:

Brimkov, Valentin E. ; Dantchev, Stefan S. ; Leoncini, Mauro
Calcolo. 36 (1999) 2 - p. 123-128 , 1999

Link: https://doi.org/10.1007/..