| Publication | Date of Publication | Type |
|---|
Tighter MA/1 circuit lower bounds from verifier efficient \(\mathbf{PCP}\)s for \(\mathbf{PSPACE}\)
| 2025-01-14 | Paper |
Nearly optimal pseudorandomness from hardness
Journal of the ACM | 2024-06-06 | Paper |
Almost Chor-Goldreich sources and adversarial random walks
| 2024-05-08 | Paper |
scientific article; zbMATH DE number 7829296 (Why is no real title available?)
| 2024-04-09 | Paper |
scientific article; zbMATH DE number 7799602 (Why is no real title available?)
| 2024-02-05 | Paper |
Entropy samplers and strong generic lower bounds for space bounded learning
| 2021-06-15 | Paper |
Amplification and Derandomization without Slowdown
SIAM Journal on Computing | 2020-10-26 | Paper |
Approximation algorithms for label cover and the log-density threshold
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
A no-go theorem for derandomized parallel repetition: beyond Feige-Kilian
| 2018-04-19 | Paper |
Low-degree test with polynomially small error
Computational Complexity | 2017-10-18 | Paper |
Candidate hard unique game
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Approximating dense MAX 2-CSPs
| 2017-08-31 | Paper |
Improved approximation algorithms for projection games
Algorithmica | 2017-03-03 | Paper |
Algorithmic construction of sets for k -restrictions
ACM Transactions on Algorithms | 2015-09-02 | Paper |
scientific article; zbMATH DE number 6474898 (Why is no real title available?)
Theory of Computing | 2015-08-21 | Paper |
On basing one-way functions on NP-hardness
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Sub-constant error low degree test of almost-linear size
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
Erratum for: ``On basing one-way functions on NP-hardness
Proceedings of the forty-second ACM symposium on Theory of computing | 2014-08-13 | Paper |
NP-hardness of approximately solving linear equations over reals
Proceedings of the forty-third annual ACM symposium on Theory of computing | 2014-06-05 | Paper |
\(\mathcal{NP}\)-hardness of approximately solving linear equations over reals
SIAM Journal on Computing | 2013-09-25 | Paper |
Improved approximation algorithms for projection games (extended abstract)
Lecture Notes in Computer Science | 2013-09-17 | Paper |
The projection games conjecture and the NP-hardness of \(\ln n\)-approximating Set-Cover
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
Sub-constant error probabilistically checkable proof of almost-linear size
Computational Complexity | 2011-02-18 | Paper |
Two-query PCP with subconstant error
Journal of the ACM | 2010-08-09 | Paper |
Sub-Constant Error Low Degree Test of Almost-Linear Size
SIAM Journal on Computing | 2009-03-16 | Paper |
