|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 11 occurrences of 11 keywords
|
|
|
|
|
Results
Found 14 publication records. Showing 14 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 2 | Jin-yi Cai, Hong Zhu |
Progress in Computational Complexity Theory.  |
J. Comput. Sci. Technol.  |
2005 |
DBLP DOI BibTeX RDF |
computational complexity theory, PCP theorem, logspace complexity, Reingold's theorem, GAP problem, complexity of lattice problems, worst-case to average-case reductions, extractors, pseudorandomness, inapproximability, primality testing, theoretical computer science, holographic algorithms |
| 1 | Adeline Langlois, Damien Stehlé |
Worst-Case to Average-Case Reductions for Module Lattices. |
IACR Cryptology ePrint Archive |
2012 |
DBLP BibTeX RDF |
|
| 1 | Thomas Watson |
Relativized Worlds Without Worst-Case to Average-Case Reductions for NP. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Thomas Watson |
Relativized Worlds without Worst-Case to Average-Case Reductions for NP. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Shachar Lovett, Tali Kaufman |
Worst case to Average case reductions for polynomials. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Tali Kaufman, Shachar Lovett |
Worst Case to Average Case Reductions for Polynomials. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Micciancio, Oded Regev |
Worst-Case to Average-Case Reductions Based on Gaussian Measures. |
SIAM J. Comput. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Dan Gutfreund, Amnon Ta-Shma |
Worst-Case to Average-Case Reductions Revisited. |
APPROX-RANDOM |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chris Peikert, Alon Rosen |
Lattices that admit logarithmic worst-case to average-case connection factors. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
algebraic number theory, worst-case to average-case reductions, lattices |
| 1 | Andrej Bogdanov, Luca Trevisan |
On Worst-Case to Average-Case Reductions for NP Problems. |
SIAM J. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 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 | Andrej Bogdanov, Luca Trevisan |
On Worst-Case to Average-Case Reductions for NP Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2005 |
DBLP BibTeX RDF |
|
| 1 | Daniele Micciancio, Oded Regev |
Worst-Case to Average-Case Reductions Based on Gaussian Measures. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Andrej Bogdanov, Luca Trevisan |
On Worst-Case to Average-Case Reductions for NP Problems. |
FOCS |
2003 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #14 of 14 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")