Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Moshkovitz, Dana"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
\mathcal{NP}
-hardness of approximately solving linear equations over reals
Subhash Khot
,
Dana Moshkovitz
SIAM Journal on Computing
42
(3), 2013, pp. 752-791
Improved approximation algorithms for projection games
Pasin Manurangsi
,
Dana Moshkovitz
Lecture Notes in Computer Science
8125
, 2013, pp. 683-694
NP
-hardness of approximately solving linear equations over reals
Subhash Khot
,
Dana Moshkovitz
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 413-419
Erratum to ``On basing one-way functions on
NP
-hardness''
Adi Akavia
,
Oded Goldreich
,
Shafi Goldwasser
,
Dana Moshkovitz
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 795-795
Two-query PCP with subconstant error
Dana Moshkovitz
,
Ran Raz
Journal of the ACM
57
(5), 2010, pp. 29: 1-29
Sub-constant error low degree test of almost-linear size
Dana Moshkovitz
,
Ran Raz
SIAM Journal on Computing
38
(1), 2008, pp. 140-180
On basing one-way functions on
NP
-hardness
Adi Akavia
,
Oded Goldreich
,
Shafi Goldwasser
,
Dana Moshkovitz
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 701-710
Sub-constant error low degree test of almost-linear size
Dana Moshkovitz
,
Ran Raz
Proceedings of the 38th Annual ACM Symposium on Theory of Computing, STOC'2006 (Seattle, Washington, USA, May 21-23, 2006)
, 2006, pp. 21-30