Следене
Dominik Scheder
Dominik Scheder
Потвърден имейл адрес: cs.sjtu.edu.cn - Начална страница
Заглавие
Позовавания
Позовавания
Година
A full derandomization of Schöning's k-SAT algorithm
RA Moser, D Scheder
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
922011
The Lovász local lemma and satisfiability
H Gebauer, RA Moser, D Scheder, E Welzl
Efficient Algorithms: Essays Dedicated to Kurt Mehlhorn on the Occasion of …, 2009
352009
Improving PPSZ for 3-SAT using critical variables
T Hertli, RA Moser, D Scheder
arXiv preprint arXiv:1009.4830, 2010
322010
Guided search and a faster deterministic algorithm for 3-SAT
D Scheder
Latin American Symposium on Theoretical Informatics, 60-71, 2008
252008
Using CSP to improve deterministic 3-SAT
K Kutzkov, D Scheder
arXiv preprint arXiv:1007.1166, 2010
192010
PPSZ for General k-SAT-making Hertli's analysis simpler and 3-SAT faster
D Scheder, JP Steinberger
32nd Computational Complexity Conference (CCC 2017), 2017
162017
Overlays and limited memory communication
P Papakonstantinou, D Scheder, H Song
2014 IEEE 29th Conference on Computational Complexity (CCC), 298-308, 2014
162014
A new bound for 3-satisfiable MaxSat and its algorithmic application
G Gutin, M Jones, D Scheder, A Yeo
Information and Computation 231, 117-124, 2013
132013
Tighter hard instances for PPSZ
P Pudlák, D Scheder, N Talebanfard
arXiv preprint arXiv:1611.01291, 2016
122016
Exponential Lower Bounds for the PPSZ k-SAT Algorithm
S Chen, D Scheder, N Talebanfard, B Tang
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
122013
PPSZ is better than you think
D Scheder
TheoretiCS 3, 2024
112024
How many conflicts does it need to be unsatisfiable?
D Scheder, P Zumstein
Theory and Applications of Satisfiability Testing–SAT 2008: 11th …, 2008
112008
Unsatisfiable linear CNF formulas are large and complex
D Scheder
arXiv preprint arXiv:0905.1587, 2009
102009
Cryptogenography
J Brody, SK Jakobsen, D Scheder, P Winkler
Proceedings of the 5th conference on Innovations in theoretical computer …, 2014
92014
Recent studies of agent incentives in internet resource allocation and pricing
Y Cheng, X Deng, D Scheder
4OR 16, 231-260, 2018
82018
The PPSZ algorithm for constraint satisfaction problems on more than two colors
T Hertli, I Hurbain, S Millius, RA Moser, D Scheder, M Szedlák
International Conference on Principles and Practice of Constraint …, 2016
82016
Super strong ETH is true for PPSZ with small resolution width
D Scheder, N Talebanfard
35th Computational Complexity Conference (CCC 2020) 169, 3, 2020
72020
On the Average Sensitivity and Density of k-CNF Formulas
D Scheder, LY Tan
International Workshop on Approximation Algorithms for Combinatorial …, 2013
72013
Unsatisfiable linear k-CNFs exist, for every k
D Scheder
arXiv preprint arXiv:0708.2336, 2007
62007
Overlays and limited memory communication mode (l) s
P Papakonstantinou, D Scheder, H Song
Proc. of the 29th Conference on Computational Complexity, 2014
52014
Системата не може да изпълни операцията сега. Опитайте отново по-късно.
Статии 1–20