Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Stefan S. Dantchev
@article{DBLP:journals/lmcs/DantchevGGM24, author = {Stefan S. Dantchev and Nicola Galesi and Abdul Ghani and Barnaby Martin}, title = {Depth lower bounds in Stabbing Planes for combinatorial principles}, journal = {Log. Methods Comput. Sci.}, volume = {20}, number = {1}, year = {2024}, url = {https://doi.org/10.46298/lmcs-20(1:1)2024}, doi = {10.46298/LMCS-20(1:1)2024}, timestamp = {Tue, 23 Jan 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/lmcs/DantchevGGM24.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stacs/DantchevGGM22, author = {Stefan S. Dantchev and Nicola Galesi and Abdul Ghani and Barnaby Martin}, editor = {Petra Berenbrink and Benjamin Monmege}, title = {Depth Lower Bounds in Stabbing Planes for Combinatorial Principles}, booktitle = {39th International Symposium on Theoretical Aspects of Computer Science, {STACS} 2022, March 15-18, 2022, Marseille, France (Virtual Conference)}, series = {LIPIcs}, volume = {219}, pages = {24:1--24:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2022}, url = {https://doi.org/10.4230/LIPIcs.STACS.2022.24}, doi = {10.4230/LIPICS.STACS.2022.24}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/stacs/DantchevGGM22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2102-07622, author = {Stefan S. Dantchev and Nicola Galesi and Abdul Ghani and Barnaby Martin}, title = {Depth lower bounds in Stabbing Planes for combinatorial principles}, journal = {CoRR}, volume = {abs/2102.07622}, year = {2021}, url = {https://arxiv.org/abs/2102.07622}, eprinttype = {arXiv}, eprint = {2102.07622}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2102-07622.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DantchevGGM21, author = {Stefan S. Dantchev and Nicola Galesi and Abdul Ghani and Barnaby Martin}, title = {Depth lower bounds in Stabbing Planes for combinatorial principles}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR21-022}}, year = {2021}, url = {https://eccc.weizmann.ac.il/report/2021/022}, eprinttype = {ECCC}, eprint = {TR21-022}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DantchevGGM21.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/latin/DantchevGM20, author = {Stefan S. Dantchev and Abdul Ghani and Barnaby Martin}, editor = {Yoshiharu Kohayakawa and Fl{\'{a}}vio Keidi Miyazawa}, title = {Sherali-Adams and the Binary Encoding of Combinatorial Principles}, booktitle = {{LATIN} 2020: Theoretical Informatics - 14th Latin American Symposium, S{\~{a}}o Paulo, Brazil, January 5-8, 2021, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {12118}, pages = {336--347}, publisher = {Springer}, year = {2020}, url = {https://doi.org/10.1007/978-3-030-61792-9\_27}, doi = {10.1007/978-3-030-61792-9\_27}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/latin/DantchevGM20.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-2008-02138, author = {Stefan S. Dantchev and Nicola Galesi and Abdul Ghani and Barnaby Martin}, title = {Proof complexity and the binary encoding of combinatorial principles}, journal = {CoRR}, volume = {abs/2008.02138}, year = {2020}, url = {https://arxiv.org/abs/2008.02138}, eprinttype = {arXiv}, eprint = {2008.02138}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-2008-02138.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DantchevGM19, author = {Stefan S. Dantchev and Nicola Galesi and Barnaby Martin}, editor = {Amir Shpilka}, title = {Resolution and the Binary Encoding of Combinatorial Principles}, booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20, 2019, New Brunswick, NJ, {USA}}, series = {LIPIcs}, volume = {137}, pages = {6:1--6:25}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik}, year = {2019}, url = {https://doi.org/10.4230/LIPIcs.CCC.2019.6}, doi = {10.4230/LIPICS.CCC.2019.6}, timestamp = {Thu, 02 Feb 2023 13:27:04 +0100}, biburl = {https://dblp.org/rec/conf/coco/DantchevGM19.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1911-00403, author = {Stefan S. Dantchev and Abdul Ghani and Barnaby Martin}, title = {Sherali-Adams and the binary encoding of combinatorial principles}, journal = {CoRR}, volume = {abs/1911.00403}, year = {2019}, url = {http://arxiv.org/abs/1911.00403}, eprinttype = {arXiv}, eprint = {1911.00403}, timestamp = {Wed, 22 Jun 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1911-00403.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1809-02843, author = {Stefan S. Dantchev and Nicola Galesi and Barnaby Martin}, title = {Resolution and the binary encoding of combinatorial principles}, journal = {CoRR}, volume = {abs/1809.02843}, year = {2018}, url = {http://arxiv.org/abs/1809.02843}, eprinttype = {arXiv}, eprint = {1809.02843}, timestamp = {Fri, 05 Oct 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1809-02843.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/BeyersdorffCDM18, author = {Olaf Beyersdorff and Judith Clymo and Stefan S. Dantchev and Barnaby Martin}, title = {The Riis Complexity Gap for {QBF} Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-024}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/024}, eprinttype = {ECCC}, eprint = {TR18-024}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCDM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DantchevGM18, author = {Stefan S. Dantchev and Nicola Galesi and Barnaby Martin}, title = {Resolution and the binary encoding of combinatorial principles}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR18-165}}, year = {2018}, url = {https://eccc.weizmann.ac.il/report/2018/165}, eprinttype = {ECCC}, eprint = {TR18-165}, timestamp = {Tue, 27 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DantchevGM18.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/mmcs/DantchevI16, author = {Stefan S. Dantchev and Ioannis P. Ivrissimtzis}, editor = {Michael S. Floater and Tom Lyche and Marie{-}Laurence Mazure and Knut M{\o}rken and Larry L. Schumaker}, title = {Simplicial Complex Entropy}, booktitle = {Mathematical Methods for Curves and Surfaces - 9th International Conference, {MMCS} 2016, T{\o}nsberg, Norway, June 23-28, 2016, Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {10521}, pages = {96--107}, publisher = {Springer}, year = {2016}, url = {https://doi.org/10.1007/978-3-319-67885-6\_5}, doi = {10.1007/978-3-319-67885-6\_5}, timestamp = {Sun, 25 Oct 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/mmcs/DantchevI16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/DantchevI16, author = {Stefan S. Dantchev and Ioannis P. Ivrissimtzis}, title = {Simplicial Complex Entropy}, journal = {CoRR}, volume = {abs/1603.07135}, year = {2016}, url = {http://arxiv.org/abs/1603.07135}, eprinttype = {arXiv}, eprint = {1603.07135}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/DantchevI16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/DantchevM14, author = {Stefan S. Dantchev and Barnaby Martin}, title = {Relativization makes contradictions harder for Resolution}, journal = {Ann. Pure Appl. Log.}, volume = {165}, number = {3}, pages = {837--857}, year = {2014}, url = {https://doi.org/10.1016/j.apal.2013.10.009}, doi = {10.1016/J.APAL.2013.10.009}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/DantchevM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DantchevM13, author = {Stefan S. Dantchev and Barnaby Martin}, title = {Rank complexity gap for Lov{\'{a}}sz-Schrijver and Sherali-Adams proof systems}, journal = {Comput. Complex.}, volume = {22}, number = {1}, pages = {191--213}, year = {2013}, url = {https://doi.org/10.1007/s00037-012-0049-1}, doi = {10.1007/S00037-012-0049-1}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/DantchevM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/DantchevM13, author = {Stefan S. Dantchev and Barnaby Martin}, editor = {Andrei A. Bulatov and Arseny M. Shur}, title = {Parameterized Resolution with Bounded Conjunction}, booktitle = {Computer Science - Theory and Applications - 8th International Computer Science Symposium in Russia, {CSR} 2013, Ekaterinburg, Russia, June 25-29, 2013. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {7913}, pages = {139--149}, publisher = {Springer}, year = {2013}, url = {https://doi.org/10.1007/978-3-642-38536-0\_12}, doi = {10.1007/978-3-642-38536-0\_12}, timestamp = {Tue, 14 May 2019 10:00:51 +0200}, biburl = {https://dblp.org/rec/conf/csr/DantchevM13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1304-4287, author = {Stefan S. Dantchev and Barnaby Martin}, title = {Relativisation makes contradictions harder for Resolution}, journal = {CoRR}, volume = {abs/1304.4287}, year = {2013}, url = {http://arxiv.org/abs/1304.4287}, eprinttype = {arXiv}, eprint = {1304.4287}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1304-4287.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/apal/DantchevM12, author = {Stefan S. Dantchev and Barnaby Martin}, title = {The limits of tractability in Resolution-based propositional proof systems}, journal = {Ann. Pure Appl. Log.}, volume = {163}, number = {6}, pages = {656--668}, year = {2012}, url = {https://doi.org/10.1016/j.apal.2011.11.001}, doi = {10.1016/J.APAL.2011.11.001}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/apal/DantchevM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cg/DantchevI12, author = {Stefan S. Dantchev and Ioannis P. Ivrissimtzis}, title = {Efficient construction of the {\v{C}}ech complex}, journal = {Comput. Graph.}, volume = {36}, number = {6}, pages = {708--713}, year = {2012}, url = {https://doi.org/10.1016/j.cag.2012.02.016}, doi = {10.1016/J.CAG.2012.02.016}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cg/DantchevI12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mst/DantchevM12, author = {Stefan S. Dantchev and Barnaby Martin}, title = {Cutting Planes and the Parameter Cutwidth}, journal = {Theory Comput. Syst.}, volume = {51}, number = {1}, pages = {50--64}, year = {2012}, url = {https://doi.org/10.1007/s00224-011-9373-0}, doi = {10.1007/S00224-011-9373-0}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/mst/DantchevM12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/corr/abs-1204-2983, author = {Stefan S. Dantchev and Barnaby Martin}, title = {Parameterized Resolution with bounded conjunction}, journal = {CoRR}, volume = {abs/1204.2983}, year = {2012}, url = {http://arxiv.org/abs/1204.2983}, eprinttype = {arXiv}, eprint = {1204.2983}, timestamp = {Mon, 13 Aug 2018 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/corr/abs-1204-2983.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cc/DantchevMS11, author = {Stefan S. Dantchev and Barnaby Martin and Stefan Szeider}, title = {Parameterized Proof Complexity}, journal = {Comput. Complex.}, volume = {20}, number = {1}, pages = {51--85}, year = {2011}, url = {https://doi.org/10.1007/s00037-010-0001-1}, doi = {10.1007/S00037-010-0001-1}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/cc/DantchevMS11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/cj/Dantchev11, author = {Stefan S. Dantchev}, title = {Dynamic Neighbourhood Cellular Automata}, journal = {Comput. J.}, volume = {54}, number = {1}, pages = {26--30}, year = {2011}, url = {https://doi.org/10.1093/comjnl/bxp019}, doi = {10.1093/COMJNL/BXP019}, timestamp = {Sat, 20 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/cj/Dantchev11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jco/DantchevFN11, author = {Stefan S. Dantchev and Tom Friedetzky and Lars Nagel}, title = {Sublinear-time algorithms for tournament graphs}, journal = {J. Comb. Optim.}, volume = {22}, number = {3}, pages = {469--481}, year = {2011}, url = {https://doi.org/10.1007/s10878-010-9325-7}, doi = {10.1007/S10878-010-9325-7}, timestamp = {Mon, 26 Oct 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jco/DantchevFN11.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BroersmaDJS10, author = {Hajo Broersma and Stefan S. Dantchev and Matthew Johnson and Stefan Szeider}, title = {Editorial}, journal = {J. Discrete Algorithms}, volume = {8}, number = {2}, pages = {101}, year = {2010}, url = {https://doi.org/10.1016/j.jda.2009.07.003}, doi = {10.1016/J.JDA.2009.07.003}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cie/DantchevM10, author = {Stefan S. Dantchev and Barnaby Martin}, editor = {Fernando Ferreira and Benedikt L{\"{o}}we and Elvira Mayordomo and Lu{\'{\i}}s Mendes Gomes}, title = {The Limits of Tractability in Resolution-Based Propositional Proof Systems}, booktitle = {Programs, Proofs, Processes, 6th Conference on Computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30 - July 4, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6158}, pages = {98--107}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-13962-8\_11}, doi = {10.1007/978-3-642-13962-8\_11}, timestamp = {Tue, 10 Dec 2019 15:37:25 +0100}, biburl = {https://dblp.org/rec/conf/cie/DantchevM10.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BroersmaDJS09, author = {Hajo Broersma and Stefan S. Dantchev and Matthew Johnson and Stefan Szeider}, title = {Editorial}, journal = {J. Discrete Algorithms}, volume = {7}, number = {2}, pages = {147}, year = {2009}, url = {https://doi.org/10.1016/j.jda.2008.09.002}, doi = {10.1016/J.JDA.2008.09.002}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/tcs/DantchevMR09, author = {Stefan S. Dantchev and Barnaby Martin and Mark Nicholas Charles Rhodes}, title = {Tight rank lower bounds for the Sherali-Adams proof system}, journal = {Theor. Comput. Sci.}, volume = {410}, number = {21-23}, pages = {2054--2063}, year = {2009}, url = {https://doi.org/10.1016/j.tcs.2009.01.002}, doi = {10.1016/J.TCS.2009.01.002}, timestamp = {Wed, 17 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/tcs/DantchevMR09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cie/DantchevM09, author = {Stefan S. Dantchev and Barnaby Martin}, editor = {Klaus Ambos{-}Spies and Benedikt L{\"{o}}we and Wolfgang Merkle}, title = {Cutting Planes and the Parameter Cutwidth}, booktitle = {Mathematical Theory and Computational Practice, 5th Conference on Computability in Europe, CiE 2009, Heidelberg, Germany, July 19-24, 2009. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5635}, pages = {134--143}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-03073-4\_15}, doi = {10.1007/978-3-642-03073-4\_15}, timestamp = {Sun, 02 Jun 2019 21:17:54 +0200}, biburl = {https://dblp.org/rec/conf/cie/DantchevM09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cocoon/DantchevFN09, author = {Stefan S. Dantchev and Tom Friedetzky and Lars Nagel}, editor = {Hung Q. Ngo}, title = {Sublinear-Time Algorithms for Tournament Graphs}, booktitle = {Computing and Combinatorics, 15th Annual International Conference, {COCOON} 2009, Niagara Falls, NY, USA, July 13-15, 2009, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {5609}, pages = {459--471}, publisher = {Springer}, year = {2009}, url = {https://doi.org/10.1007/978-3-642-02882-3\_46}, doi = {10.1007/978-3-642-02882-3\_46}, timestamp = {Mon, 16 Sep 2019 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/cocoon/DantchevFN09.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jda/BroersmaDJS08, author = {Hajo Broersma and Stefan S. Dantchev and Matthew Johnson and Stefan Szeider}, title = {Preface}, journal = {J. Discrete Algorithms}, volume = {6}, number = {4}, pages = {539}, year = {2008}, url = {https://doi.org/10.1016/j.jda.2008.07.005}, doi = {10.1016/J.JDA.2008.07.005}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jda/BroersmaDJS08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/bcs/Dantchev08, author = {Stefan S. Dantchev}, editor = {Erol Gelenbe and Samson Abramsky and Vladimiro Sassone}, title = {Dynamic Neighbourhood Cellular Automata}, booktitle = {Visions of Computer Science - {BCS} International Academic Conference, Imperial College, London, UK, 22-24 September 2008}, pages = {60--68}, publisher = {British Computer Society}, year = {2008}, url = {http://www.bcs.org/server.php?show=ConWebDoc.22850}, timestamp = {Mon, 21 Sep 2009 12:13:42 +0200}, biburl = {https://dblp.org/rec/conf/bcs/Dantchev08.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/ivc/BrimkovD07, author = {Valentin E. Brimkov and Stefan S. Dantchev}, title = {Digital hyperplane recognition in arbitrary fixed dimension within an algebraic computation model}, journal = {Image Vis. Comput.}, volume = {25}, number = {10}, pages = {1631--1643}, year = {2007}, url = {https://doi.org/10.1016/j.imavis.2006.06.013}, doi = {10.1016/J.IMAVIS.2006.06.013}, timestamp = {Thu, 20 Feb 2020 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/ivc/BrimkovD07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DantchevMS07, author = {Stefan S. Dantchev and Barnaby Martin and Stefan Szeider}, title = {Parameterized Proof Complexity}, booktitle = {48th Annual {IEEE} Symposium on Foundations of Computer Science {(FOCS} 2007), October 20-23, 2007, Providence, RI, USA, Proceedings}, pages = {150--160}, publisher = {{IEEE} Computer Society}, year = {2007}, url = {https://doi.org/10.1109/FOCS.2007.53}, doi = {10.1109/FOCS.2007.53}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DantchevMS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/stoc/Dantchev07, author = {Stefan S. Dantchev}, editor = {David S. Johnson and Uriel Feige}, title = {Rank complexity gap for Lov{\'{a}}sz-Schrijver and Sherali-Adams proof systems}, booktitle = {Proceedings of the 39th Annual {ACM} Symposium on Theory of Computing, San Diego, California, USA, June 11-13, 2007}, pages = {311--317}, publisher = {{ACM}}, year = {2007}, url = {https://doi.org/10.1145/1250790.1250837}, doi = {10.1145/1250790.1250837}, timestamp = {Tue, 06 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/stoc/Dantchev07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/DantchevMS07, author = {Stefan S. Dantchev and Barnaby Martin and Stefan Szeider}, title = {Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR07-001}}, year = {2007}, url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-001/index.html}, eprinttype = {ECCC}, eprint = {TR07-001}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/DantchevMS07.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/cie/Dantchev06, author = {Stefan S. Dantchev}, editor = {Arnold Beckmann and Ulrich Berger and Benedikt L{\"{o}}we and John V. Tucker}, title = {On the Complexity of the Sperner Lemma}, booktitle = {Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3988}, pages = {115--124}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11780342\_12}, doi = {10.1007/11780342\_12}, timestamp = {Tue, 14 May 2019 10:00:41 +0200}, biburl = {https://dblp.org/rec/conf/cie/Dantchev06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/Dantchev06, author = {Stefan S. Dantchev}, editor = {Dima Grigoriev and John Harrison and Edward A. Hirsch}, title = {Relativisation Provides Natural Separations for Resolution-Based Proof Systems}, booktitle = {Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3967}, pages = {147--158}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11753728\_17}, doi = {10.1007/11753728\_17}, timestamp = {Tue, 29 Nov 2022 13:36:56 +0100}, biburl = {https://dblp.org/rec/conf/csr/Dantchev06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csr/DantchevM06, author = {Stefan S. Dantchev and Florent R. Madelaine}, editor = {Dima Grigoriev and John Harrison and Edward A. Hirsch}, title = {Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems}, booktitle = {Computer Science - Theory and Applications, First International Symposium on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia, June 8-12, 2006, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3967}, pages = {159--170}, publisher = {Springer}, year = {2006}, url = {https://doi.org/10.1007/11753728\_18}, doi = {10.1007/11753728\_18}, timestamp = {Fri, 02 Nov 2018 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/csr/DantchevM06.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@proceedings{DBLP:conf/acid/2006, editor = {Hajo Broersma and Stefan S. Dantchev and Matthew Johnson and Stefan Szeider}, title = {Algorithms and Complexity in Durham 2006 - Proceedings of the Second ACiD Workshop, 18-20 September 2006, Durham, {UK}}, series = {Texts in Algorithmics}, volume = {7}, publisher = {King's College, London}, year = {2006}, isbn = {1-904987-38-9}, timestamp = {Tue, 24 Jul 2007 01:00:00 +0200}, biburl = {https://dblp.org/rec/conf/acid/2006.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/dgci/BrimkovD05, author = {Valentin E. Brimkov and Stefan S. Dantchev}, editor = {Eric Andres and Guillaume Damiand and Pascal Lienhardt}, title = {Complexity Analysis for Digital Hyperplane Recognition in Arbitrary Fixed Dimension}, booktitle = {Discrete Geometry for Computer Imagery, 12th International Conference, {DGCI} 2005, Poitiers, France, April 13-15, 2005, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {3429}, pages = {287--298}, publisher = {Springer}, year = {2005}, url = {https://doi.org/10.1007/978-3-540-31965-8\_27}, doi = {10.1007/978-3-540-31965-8\_27}, timestamp = {Tue, 14 May 2019 10:00:47 +0200}, biburl = {https://dblp.org/rec/conf/dgci/BrimkovD05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sac/DantchevV05, author = {Stefan S. Dantchev and Frank D. Valencia}, editor = {Hisham Haddad and Lorie M. Liebrock and Andrea Omicini and Roger L. Wainwright}, title = {On the computational limits of infinite satisfaction}, booktitle = {Proceedings of the 2005 {ACM} Symposium on Applied Computing (SAC), Santa Fe, New Mexico, USA, March 13-17, 2005}, pages = {393--397}, publisher = {{ACM}}, year = {2005}, url = {https://doi.org/10.1145/1066677.1066768}, doi = {10.1145/1066677.1066768}, timestamp = {Tue, 06 Nov 2018 11:06:45 +0100}, biburl = {https://dblp.org/rec/conf/sac/DantchevV05.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/csl/DantchevR03, author = {Stefan S. Dantchev and S{\o}ren Riis}, editor = {Matthias Baaz and Johann A. Makowsky}, title = {On Relativisation and Complexity Gap}, booktitle = {Computer Science Logic, 17th International Workshop, {CSL} 2003, 12th Annual Conference of the EACSL, and 8th Kurt G{\"{o}}del Colloquium, {KGC} 2003, Vienna, Austria, August 25-30, 2003, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {2803}, pages = {142--154}, publisher = {Springer}, year = {2003}, url = {https://doi.org/10.1007/978-3-540-45220-1\_14}, doi = {10.1007/978-3-540-45220-1\_14}, timestamp = {Tue, 14 May 2019 10:00:42 +0200}, biburl = {https://dblp.org/rec/conf/csl/DantchevR03.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/appml/BrimkovD02, author = {Valentin E. Brimkov and Stefan S. Dantchev}, title = {An alternative to Ben-Or's lower bound for the knapsack problem complexity}, journal = {Appl. Math. Lett.}, volume = {15}, number = {2}, pages = {187--191}, year = {2002}, url = {https://doi.org/10.1016/S0893-9659(01)00116-1}, doi = {10.1016/S0893-9659(01)00116-1}, timestamp = {Fri, 26 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/appml/BrimkovD02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/mp/Dantchev02, author = {Stefan S. Dantchev}, title = {Improved sorting-based procedure for integer programming}, journal = {Math. Program.}, volume = {92}, number = {2}, pages = {297--300}, year = {2002}, url = {https://doi.org/10.1007/s101070100245}, doi = {10.1007/S101070100245}, timestamp = {Sat, 27 May 2017 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/mp/Dantchev02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/Dantchev02, author = {Stefan S. Dantchev}, title = {Resolution Width-Size Trade-offs for the Pigeon-Hole Principle}, booktitle = {Proceedings of the 17th Annual {IEEE} Conference on Computational Complexity, Montr{\'{e}}al, Qu{\'{e}}bec, Canada, May 21-24, 2002}, pages = {39--43}, publisher = {{IEEE} Computer Society}, year = {2002}, url = {https://doi.org/10.1109/CCC.2002.1004337}, doi = {10.1109/CCC.2002.1004337}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/Dantchev02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/coco/DantchevR01, author = {Stefan S. Dantchev and S{\o}ren Riis}, title = {Tree Resolution Proofs of the Weak Pigeon-Hole Principle}, booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational Complexity, Chicago, Illinois, USA, June 18-21, 2001}, pages = {69--75}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/CCC.2001.933873}, doi = {10.1109/CCC.2001.933873}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/coco/DantchevR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/focs/DantchevR01, author = {Stefan S. Dantchev and S{\o}ren Riis}, title = {"Planar" Tautologies Hard for Resolution}, booktitle = {42nd Annual Symposium on Foundations of Computer Science, {FOCS} 2001, 14-17 October 2001, Las Vegas, Nevada, {USA}}, pages = {220--229}, publisher = {{IEEE} Computer Society}, year = {2001}, url = {https://doi.org/10.1109/SFCS.2001.959896}, doi = {10.1109/SFCS.2001.959896}, timestamp = {Thu, 23 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/focs/DantchevR01.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/ifipTCS/BrimkovD00, author = {Valentin E. Brimkov and Stefan S. Dantchev}, editor = {Jan van Leeuwen and Osamu Watanabe and Masami Hagiya and Peter D. Mosses and Takayasu Ito}, title = {On the Complexity of Integer Programming in the Blum-Shub-Smale Computational Model}, booktitle = {Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics, International Conference {IFIP} {TCS} 2000, Sendai, Japan, August 17-19, 2000, Proceedings}, series = {Lecture Notes in Computer Science}, volume = {1872}, pages = {286--300}, publisher = {Springer}, year = {2000}, url = {https://doi.org/10.1007/3-540-44929-9\_22}, doi = {10.1007/3-540-44929-9\_22}, timestamp = {Tue, 14 May 2019 10:00:36 +0200}, biburl = {https://dblp.org/rec/conf/ifipTCS/BrimkovD00.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR00-017, author = {Valentin E. Brimkov and Stefan S. Dantchev}, title = {On the Algebraic Complexity of Integer Programming}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR00-017}}, year = {2000}, url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-017/index.html}, eprinttype = {ECCC}, eprint = {TR00-017}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-017.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/eccc/ECCC-TR98-015, author = {Valentin E. Brimkov and Stefan S. Dantchev}, title = {Lower Bounds, "Pseudopolynomial" and Approximation Algorithms for the Knapsack Problem with Real Coefficients}, journal = {Electron. Colloquium Comput. Complex.}, volume = {{TR98-015}}, year = {1998}, url = {https://eccc.weizmann.ac.il/eccc-reports/1998/TR98-015/index.html}, eprinttype = {ECCC}, eprint = {TR98-015}, timestamp = {Wed, 28 Sep 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR98-015.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/BrimkovD97, author = {Valentin E. Brimkov and Stefan S. Dantchev}, title = {Real Data--Integer Solution Problems within the Blum-Shub-Smale Computational Model}, journal = {J. Complex.}, volume = {13}, number = {2}, pages = {279--300}, year = {1997}, url = {https://doi.org/10.1006/jcom.1997.0446}, doi = {10.1006/JCOM.1997.0446}, timestamp = {Tue, 16 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/BrimkovD97.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.