Stefan S. Dantchev

Available identifiers

zbMath Open dantchev.stefan-sMaRDI QIDQ1300668

List of research outcomes

Publication	Date of Publication	Type
Depth lower bounds in stabbing planes for combinatorial principles	2024-04-23	Paper
Resolution and the binary encoding of combinatorial principles	2022-07-27	Paper
Simplicial complex entropy	2018-01-19	Paper
Relativization makes contradictions harder for resolution	2013-12-16	Paper
Parameterized Resolution with Bounded Conjunction	2013-06-14	Paper
Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems	2013-04-11	Paper
Cutting planes and the parameter cutwidth	2012-12-07	Paper
Parameterized proof complexity	2012-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q2907589	2012-09-10	Paper
The limits of tractability in resolution-based propositional proof systems	2012-03-29	Paper
Sublinear-time algorithms for tournament graphs	2011-12-15	Paper
The Limits of Tractability in Resolution-Based Propositional Proof Systems	2010-07-29	Paper
Cutting Planes and the Parameter Cutwidth	2010-07-28	Paper
Sublinear-Time Algorithms for Tournament Graphs	2009-07-23	Paper
Tight rank lower bounds for the Sherali-Adams proof system	2009-05-28	Paper
https://portal.mardi4nfdi.de/entity/Q3549627	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3528931	2008-10-17	Paper
https://portal.mardi4nfdi.de/entity/Q3524457	2008-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q5442300	2008-02-22	Paper
Computer Science Logic	2007-06-21	Paper
Relativisation Provides Natural Separations for Resolution-Based Proof Systems	2007-05-02	Paper
Bounded-Degree Forbidden Patterns Problems Are Constraint Satisfaction Problems	2007-05-02	Paper
Logical Approaches to Computational Barriers	2007-04-30	Paper
https://portal.mardi4nfdi.de/entity/Q3432168	2007-04-16	Paper
Discrete Geometry for Computer Imagery	2005-09-13	Paper
Improved sorting-based procedure for integer programming	2003-01-20	Paper
https://portal.mardi4nfdi.de/entity/Q4536432	2002-11-28	Paper
An alternative to Ben-Or's lower bound for the knapsack problem complexity	2002-08-15	Paper
Tight complexity bounds for the two-dimensional real knapsack problem	2000-10-22	Paper
https://portal.mardi4nfdi.de/entity/Q4936050	2000-01-20	Paper
Real data-integer solution problems within the Blum-Shub-Smale computational model	1997-11-20	Paper
https://portal.mardi4nfdi.de/entity/Q4870591	1996-07-17	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Stefan S. Dantchev