The following pages link to Dan Gutfreund (Q374167):
Displayed 16 items.
- Exploiting label dependencies for improved sample complexity (Q374170) (← links)
- Boosting conditional probability estimators (Q513339) (← links)
- Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
- Trading help for interaction in statistical zero-knowledge proofs (Q1402366) (← links)
- Uniform hardness versus randomness tradeoffs for Arthur-Merlin games (Q1762663) (← links)
- A lower bound for testing juntas (Q2390270) (← links)
- If NP languages are hard on the worst-case, then it is easy to find their hard instances (Q2475580) (← links)
- (Q2707437) (← links)
- The Complexity of Local List Decoding (Q3541812) (← links)
- Limitations of Hardness vs. Randomness under Uniform Reductions (Q3541813) (← links)
- (Q3549643) (← links)
- (Q3549694) (← links)
- Worst-Case Vs. Algorithmic Average-Case Complexity in the Polynomial-Time Hierarchy (Q3595406) (← links)
- Worst-Case to Average-Case Reductions Revisited (Q3603494) (← links)
- Succinct Permanent Is NEXP-Hard with Many Hard Instances (Q4924648) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313041) (← links)