The SCEAS System
| |||||||

## Search the dblp DataBase
Stefan S. Dantchev:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Stefan S. Dantchev
**On the Complexity of the Sperner Lemma.**[Citation Graph (0, 0)][DBLP] CiE, 2006, pp:115-124 [Conf] - 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] - 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] - Stefan S. Dantchev, Søren Riis
**On Relativisation and Complexity Gap.**[Citation Graph (0, 0)][DBLP] CSL, 2003, pp:142-154 [Conf] - Stefan S. Dantchev
**Relativisation Provides Natural Separations for Resolution-Based Proof Systems.**[Citation Graph (0, 0)][DBLP] CSR, 2006, pp:147-158 [Conf] - 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] - 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] - Stefan S. Dantchev, Søren Riis
**"Planar" Tautologies Hard for Resolution.**[Citation Graph (0, 0)][DBLP] FOCS, 2001, pp:220-229 [Conf] - 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] - Stefan S. Dantchev, Frank D. Valencia
**On the computational limits of infinite satisfaction.**[Citation Graph (0, 0)][DBLP] SAC, 2005, pp:393-397 [Conf] - 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] - 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] - 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] - 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] - 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] **Cutting Planes and the Parameter Cutwidth.**[Citation Graph (, )][DBLP]**The Limits of Tractability in Resolution-Based Propositional Proof Systems.**[Citation Graph (, )][DBLP]**Sublinear-Time Algorithms for Tournament Graphs.**[Citation Graph (, )][DBLP]**Parameterized Proof Complexity.**[Citation Graph (, )][DBLP]**Dynamic Neighbourhood Cellular Automata.**[Citation Graph (, )][DBLP]**Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution.**[Citation Graph (, )][DBLP]
Search in 0.034secs, Finished in 0.034secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |