Dana Moshkovitz

Available identifiers

zbMath Open moshkovitz.danaMaRDI QIDQ513282

List of research outcomes

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	2024-06-06	Paper
Almost Chor-Goldreich sources and adversarial random walks	2024-05-08	Paper
https://portal.mardi4nfdi.de/entity/Q6126299	2024-04-09	Paper
https://portal.mardi4nfdi.de/entity/Q6146253	2024-02-05	Paper
https://portal.mardi4nfdi.de/entity/Q4993292	2021-06-15	Paper
Amplification and Derandomization without Slowdown	2020-10-26	Paper
Approximation Algorithms for Label Cover and The Log-Density Threshold	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	2017-10-18	Paper
Candidate hard unique game	2017-09-29	Paper
Approximating Dense Max 2-CSPs	2017-08-31	Paper
Improved approximation algorithms for projection games	2017-03-03	Paper
Algorithmic construction of sets for k -restrictions	2015-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q2941638	2015-08-21	Paper
Sub-constant error low degree test of almost-linear size	2014-11-25	Paper
On basing one-way functions on NP-hardness	2014-11-25	Paper
Erratum for	2014-08-13	Paper
NP-hardness of approximately solving linear equations over reals	2014-06-05	Paper
$\mathcal{NP}$-Hardness of Approximately Solving Linear Equations over Reals	2013-09-25	Paper
Improved Approximation Algorithms for Projection Games	2013-09-17	Paper
The Projection Games Conjecture and the NP-Hardness of ln n-Approximating Set-Cover	2012-11-02	Paper
Sub-constant error probabilistically checkable proof of almost-linear size	2011-02-18	Paper
Two-query PCP with subconstant error	2010-08-09	Paper
Sub-Constant Error Low Degree Test of Almost-Linear Size	2009-03-16	Paper

Research outcomes over time

This page was built for person: Dana Moshkovitz