Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, M

DOI10.1007/978-3-642-22670-0zbMATH Open1220.68005OpenAlexW1835740177MaRDI QIDQ593267FDOQ593267

Authors:

Publication date: 29 July 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22670-0

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited In (2)

• Lower bounds on black-box reductions of hitting to density estimation
• Counting solutions to polynomial systems via reductions

This page was built for publication: Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, M

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q593267)