A. Bogdanov and L. Trevisan. On Worst-Case to Average-Case Reductions for NP Problems. Electronic Colloquium on Computational Complexity, Report 2005/247, 2005. http://eccc.uni-trier.de/eccc-reports/2005/TR05-017/index.htm. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Notions of Reducibility between Cryptographic Primitives - Reingold, Trevisan, Vadhan (2004) (2 citations) Self-citation (Trevisan) (Correct)
No context found.
Andrej Bogdanov and Luca Trevisan. On worst-case to average-case reductions for NP problems. In Proc. of 44th IEEE Symposium on Foundations of Computer Science (FOCS'03), pages 308--317, 2003.
Is SHA-1 conceptually sound? - Jutla, Patthak (2005) (Correct)
No context found.
A. Bogdanov and L. Trevisan. On Worst-Case to Average-Case Reductions for NP Problems. Electronic Colloquium on Computational Complexity, Report 2005/247, 2005. http://eccc.uni-trier.de/eccc-reports/2005/TR05-017/index.htm.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC