[The University of Leicester][Department of Mathematics and Computer Science]
  Dantchev's papers  

[CCC 01] S. Dantchev and S. Riis .
Tree Resolution proofs of the Weak Pigeon-Hole Principle . In (editors), Proceedings of the 16th Annual Conference on Computational Complexity (CCC'01) June 18 - 21, 2001 Chicago, Illinois , 69-75. IEEE (2001).
[FOCS 01] S. Dantchev and S. Riis .
Planar tautologies hard for Resolution . In (editors), Proceedings of the 42nd IEEE symposium on Foundations of Computer Science (FOCS'01) October 14 - 17, 2001 Las Vegas, Nevada , 220-229. IEEE (2001).
[CCC 02] S. Dantchev .
Resolution Width-Size Trade-offs for the Pigeon-Hole Principle . In (editors), Proceedings of the 17th Annual Conference on Computational Complexity (CCC'01) May 21 - 24, 2002 Montreal, Canada , 39-43. IEEE (2002).
[Math Prog 02] S. Dantchev .
Improved sorting-based procedure for integer programming . Mathematical Programming, series A , 2 92 (2002), 297-300. Springer .
[University Home][Faculty of Science][MCS Home][University Index A-Z][University Search][University Help]

Last modified: 11th December 2002, 18:09:03
MCS Web Maintainer
Any opinions expressed on this page are those of the author.
© University of Leicester.