Search the dblp DataBase

Publications of Author

1. Stefan S. Dantchev
   On the Complexity of the Sperner Lemma. [Citation Graph (0, 0)][DBLP]
   CiE, 2006, pp:115-124 [Conf]
   
2. Stefan S. Dantchev
   Resolution Width-Size Trade-offs for the Pigeon-Hole Principle. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2002, pp:39-43 [Conf]
   
3. Stefan S. Dantchev, Søren Riis
   Tree Resolution Proofs of the Weak Pigeon-Hole Principle. [Citation Graph (0, 0)][DBLP]
   IEEE Conference on Computational Complexity, 2001, pp:69-75 [Conf]
   
4. Stefan S. Dantchev, Søren Riis
   On Relativisation and Complexity Gap. [Citation Graph (0, 0)][DBLP]
   CSL, 2003, pp:142-154 [Conf]
   
5. Stefan S. Dantchev
   Relativisation Provides Natural Separations for Resolution-Based Proof Systems. [Citation Graph (0, 0)][DBLP]
   CSR, 2006, pp:147-158 [Conf]
   
6. Stefan S. Dantchev, Florent R. Madelaine
   Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP]
   CSR, 2006, pp:159-170 [Conf]
   
7. Valentin E. Brimkov, Stefan S. Dantchev
   Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension. [Citation Graph (0, 0)][DBLP]
   DGCI, 2005, pp:287-298 [Conf]
   
8. Stefan S. Dantchev, Søren Riis
   "Planar" Tautologies Hard for Resolution. [Citation Graph (0, 0)][DBLP]
   FOCS, 2001, pp:220-229 [Conf]
   
9. Valentin E. Brimkov, Stefan S. Dantchev
   On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model. [Citation Graph (0, 0)][DBLP]
   IFIP TCS, 2000, pp:286-300 [Conf]
   
10. Stefan S. Dantchev, Frank D. Valencia
    On the computational limits of infinite satisfaction. [Citation Graph (0, 0)][DBLP]
    SAC, 2005, pp:393-397 [Conf]
    
11. Valentin E. Brimkov, Stefan S. Dantchev
    An alternative to Ben-Or's lower bound for the knapsack problem complexity. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2002, v:15, n:2, pp:187-191 [Journal]
    
12. Valentin E. Brimkov, Stefan S. Dantchev
    On the Algebraic Complexity of Integer Programming [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:17, pp:- [Journal]
    
13. Valentin E. Brimkov, Stefan S. Dantchev
    Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:2, pp:279-300 [Journal]
    
14. Stefan S. Dantchev
    Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:311-317 [Conf]
    
15. Valentin E. Brimkov, Stefan S. Dantchev
    Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model. [Citation Graph (0, 0)][DBLP]
    Image Vision Comput., 2007, v:25, n:10, pp:1631-1643 [Journal]
    
16. 
    Cutting Planes and the Parameter Cutwidth. [Citation Graph (, )][DBLP]
    
    
17. 
    The Limits of Tractability in Resolution-Based Propositional Proof Systems. [Citation Graph (, )][DBLP]
    
    
18. 
    Sublinear-Time Algorithms for Tournament Graphs. [Citation Graph (, )][DBLP]
    
    
19. 
    Parameterized Proof Complexity. [Citation Graph (, )][DBLP]
    
    
20. 
    Dynamic Neighbourhood Cellular Automata. [Citation Graph (, )][DBLP]
    
    
21. 
    Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution. [Citation Graph (, )][DBLP]