Andrew Drucker
-
Title: An Improved Exponential-Time Approximation Algorithm for Fully-Alternating Games Against Nature
Speaker:
Link:
-
Title: Do NP-Hard Problems Require Exponential Time?
Speaker:
Link:
-
Title: Exponential-time algorithms for NP problems: prospects and limits
Speaker:
Link:
-
Title: Nondeterministic Direct Product Reductions and the Success Probability of SAT Solvers
Speaker:
Link:
-
Title: On the AND- and OR-Conjectures: Limits to Efficient Preprocessing
Speaker:
Link:
-
Title: The Complexity of Transforming Problem Instances
Speaker:
Link:
-
Title: High-Confidence Predictions under Adversarial Uncertainty
Speaker:
Link: