Stanislav Živný
Stanislav Živný
Associate Professor, University of Oxford
Подтвержден адрес электронной почты в домене cs.ox.ac.uk - Главная страница
Название
Процитировано
Процитировано
Год
The complexity of finite-valued CSPs
J Thapper, S Živný
Journal of the ACM (JACM) 63 (4), 2016
1162016
The power of linear programming for valued CSPs
J Thapper, S Živný
53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS'12), 669-678, 2012
852012
The complexity of conservative valued CSPs
V Kolmogorov, S Živný
Journal of the ACM (JACM) 60 (2), 2013
76*2013
The power of linear programming for general-valued CSPs
V Kolmogorov, J Thapper, S Zivny
SIAM Journal on Computing 44 (1), 1-36, 2015
742015
An algebraic theory of complexity for discrete optimisation
D Cohen, M Cooper, P Creed, P Jeavons, S Živný
SIAM Journal on Computing 42 (5), 1915-1939, 2013
73*2013
The expressive power of binary submodular functions
S Živný, DA Cohen, PG Jeavons
Discrete Applied Mathematics 157 (15), 3347-3358, 2009
622009
The Complexity of Valued Constraint Satisfaction Problems
S Živný
Springer-Verlag New York Incorporated, 2012
51*2012
Hybrid tractability of valued constraint problems
MC Cooper, S Živný
Artificial Intelligence 175 (9-10), 1555-1569, 2011
51*2011
Relating proof complexity measures and practical hardness of SAT
M Järvisalo, A Matsliah, J Nordström, S Živný
International Conference on Principles and Practice of Constraint …, 2012
392012
Tractable Triangles and Cross-Free Convexity in Discrete Optimisation
MC Cooper, S Živný
Journal of Artificial Intelligence Research 44, 455-490, 2012
39*2012
Maximizing bisubmodular and k-submodular functions
J Ward, S Živný
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete …, 2014
33*2014
Classes of submodular constraints expressible by graph cuts
S Živný, PG Jeavons
Constraints 15 (3), 430-452, 2010
332010
The complexity of valued constraint satisfaction
P Jeavons, A Krokhin, S Živný
Bulletin of EATCS 2 (113), 2014
312014
The Constraint Satisfaction Problem: Complexity and Approximability
A Krokhin, S Zivny
Schloss Dagstuhl, 2017
252017
The complexity of valued CSPs.
A Krokhin, S Živný
Schloss Dagstuhl–Leibniz-Zentrum für Informatik, 2017
212017
The Power of Sherali--Adams Relaxations for General-Valued CSPs
J Thapper, S Zivny
SIAM Journal on Computing 46 (4), 1241-1279, 2017
192017
Sherali-Adams relaxations for valued CSPs
J Thapper, S Zivny
Proceedings of the 42nd International Colloquium on Automata, Languages, and …, 2015
192015
Backdoors into heterogeneous classes of SAT and CSP
S Gaspers, N Misra, S Ordyniak, S Szeider, S Živný
Journal of Computer and System Sciences 85, 38-56, 2017
182017
Variable and value elimination in binary constraint satisfaction via forbidden patterns
DA Cohen, MC Cooper, G Escamocher, S Živný
Journal of Computer and System Sciences 81 (7), 1127-1143, 2015
182015
Hybrid tractable classes of constraint problems
MC Cooper, S Zivny
Dagstuhl Follow-Ups 7, 2017
142017
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20