Funder
Exploratory Research Center on Life and Living Systems, National Institutes of Natural Sciences
Natural Sciences and Engineering Research Council of Canada
Independent Research Fund Denmark
Danmarks Frie Forskningsfond
Subject
General Computer Science,Theoretical Computer Science
Reference51 articles.
1. A sharp threshold in proof complexity yields lower bounds for satisfiability search;Achlioptas;J. Comput. Syst. Sci.,2004
2. Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas;Alekhnovich;J. Automat. Reason.,2005
3. Toward a model for backtracking and dynamic programming;Alekhnovich;Comput. Complex.,2011
4. On the power of priority algorithms for facility location and set cover;Angelopoulos;Algorithmica,2004
5. On the power of randomization in on-line algorithms;Ben-David;Algorithmica,1994