Erratum: On basing one-way functions on NP-hardness (Proceedings of the Annual ACM Symposium on Theory of Computing DOI: acm.org/10.1145/1132516.1132614)

Adi Akavia; Oded Goldreich; Shafi Goldwasser; Dana Moshkovitz

doi:10.1145/1806689.1806798

Erratum: On basing one-way functions on NP-hardness (Proceedings of the Annual ACM Symposium on Theory of Computing DOI: acm.org/10.1145/1132516.1132614)

Adi Akavia, Oded Goldreich, Shafi Goldwasser, Dana Moshkovitz

Research output: Contribution to journal › Comment/Debate

Original language	English
Pages (from-to)	795
Number of pages	1
Journal	Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs	https://doi.org/10.1145/1806689.1806798
State	Published - 2010
Externally published	Yes
Event	42nd ACM Symposium on Theory of Computing, STOC 2010 - Cambridge, MA, United States Duration: 5 Jun 2010 → 8 Jun 2010

Keywords

average case complexity
erratum
one-way function
worst case complexity

ASJC Scopus subject areas

Software

Access to Document

10.1145/1806689.1806798

Cite this

@article{9e656d781a9049bab2b64c4f4c0cdf90,

title = "Erratum: On basing one-way functions on NP-hardness (Proceedings of the Annual ACM Symposium on Theory of Computing DOI: acm.org/10.1145/1132516.1132614)",

keywords = "average case complexity, erratum, one-way function, worst case complexity",

author = "Adi Akavia and Oded Goldreich and Shafi Goldwasser and Dana Moshkovitz",

year = "2010",

doi = "10.1145/1806689.1806798",

language = "English",

pages = "795",

journal = "Proceedings of the Annual ACM Symposium on Theory of Computing",

issn = "0737-8017",

publisher = "Association for Computing Machinery (ACM)",

note = "42nd ACM Symposium on Theory of Computing, STOC 2010 ; Conference date: 05-06-2010 Through 08-06-2010",

}

TY - JOUR

T1 - Erratum

T2 - 42nd ACM Symposium on Theory of Computing, STOC 2010

AU - Akavia, Adi

AU - Goldreich, Oded

AU - Goldwasser, Shafi

AU - Moshkovitz, Dana

PY - 2010

Y1 - 2010

KW - average case complexity

KW - erratum

KW - one-way function

KW - worst case complexity

UR - http://www.scopus.com/inward/record.url?scp=77954730149&partnerID=8YFLogxK

U2 - 10.1145/1806689.1806798

DO - 10.1145/1806689.1806798

M3 - Comment/Debate

AN - SCOPUS:77954730149

SN - 0737-8017

SP - 795

JO - Proceedings of the Annual ACM Symposium on Theory of Computing

JF - Proceedings of the Annual ACM Symposium on Theory of Computing

Y2 - 5 June 2010 through 8 June 2010

ER -

Erratum: On basing one-way functions on NP-hardness (Proceedings of the Annual ACM Symposium on Theory of Computing DOI: acm.org/10.1145/1132516.1132614)

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this