Dan Gutfreund

Available identifiers

Publication	Date of Publication	Type
Boosting conditional probability estimators	2017-03-06	Paper
Exploiting label dependencies for improved sample complexity	2013-10-22	Paper
Succinct Permanent Is NEXP-Hard with Many Hard Instances	2013-06-07	Paper
Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds	2011-11-08	Paper
A lower bound for testing juntas	2009-07-21	Paper
Worst-Case to Average-Case Reductions Revisited	2009-02-17	Paper
Verifying and decoding in constant depth	2009-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q3549694	2009-01-05	Paper
The Complexity of Local List Decoding	2008-11-27	Paper
Limitations of Hardness vs. Randomness under Uniform Reductions	2008-11-27	Paper
If NP languages are hard on the worst-case, then it is easy to find their hard instances	2008-03-11	Paper
Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy	2007-08-28	Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2005-08-25	Paper
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games	2005-02-11	Paper
Trading help for interaction in statistical zero-knowledge proofs	2003-08-27	Paper
https://portal.mardi4nfdi.de/entity/Q2707437	2002-03-12	Paper

This page was built for person: Dan Gutfreund