|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 10 occurrences of 10 keywords
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Dana Moshkovitz |
The tale of the PCP theorem.  |
ACM Crossroads  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz |
Guest column: algebraic construction of projection PCPs. |
SIGACT News |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz |
The Projection Games Conjecture and The NP-Hardness of ln n-Approximating Set-Cover. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Subhash Khot, Dana Moshkovitz |
NP-hardness of approximately solving linear equations over reals. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Subhash Khot, Dana Moshkovitz |
NP-Hardness of Approximately Solving Linear Equations Over Reals. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz |
An Alternative Proof of The Schwartz-Zippel Lemma. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz, Subhash Khot |
Hardness of Approximately Solving Linear Equations Over Reals. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Two-query PCP with subconstant error. |
J. ACM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Probabilistically Checkable Proof of Almost-Linear Size. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Prahladh Harsha, Moses Charikar, Matthew Andrews, Sanjeev Arora, Subhash Khot, Dana Moshkovitz, Lisa Zhang, Ashkan Aazami, Dev Desai, Igor Gorodezky, Geetha Jagannathan, Alexander S. Kulikov, Darakhshan J. Mir, Alantha Newman, Aleksandar Nikolov, David Pritchard, Gwen Spencer |
Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
Erratum for: on basing one-way functions on NP-hardness. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Two Query PCP with Sub-Constant Error. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Low Degree Test of Almost-Linear Size. |
SIAM J. Comput. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Two Query PCP with Sub-Constant Error. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Probabilistically Checkable Proof of Almost Linear Size. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Dana Moshkovitz, Shmuel Safra |
Algorithmic construction of sets for k-restrictions. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
k-restriction, almost k-wise independence, generalized hashing, splitter, Set-Cover, Derandomization, group testing |
| 1 | Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz |
On basing one-way functions on NP-hardness. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
adaptive versus non-adaptive machines, reductions, one-way functions, interactive proof systems, average-case complexity |
| 1 | Dana Moshkovitz, Ran Raz |
Sub-constant error low degree test of almost-linear size. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
plane vs. point test, probabilistically checkable proofs, locally testable codes, low degree testing |
| 1 | Dana Moshkovitz, Ran Raz |
Sub-Constant Error Low Degree Test of Almost Linear Size |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")