Can PPAD Hardness be Based on Standard Cryptographic Assumptions? - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Alon Rosen, Gil Segev, Ido Shahaf. Can PPAD Hardness be Based on Standard Cryptographic Assumptions?. In Yael Kalai, Leonid Reyzin, editors, Theory of Cryptography - 15th International Conference, TCC 2017, Baltimore, MD, USA, November 12-15, 2017, Proceedings, Part II. Volume 10678 of Lecture Notes in Computer Science, pages 747-776, Springer, 2017. [doi]

This author has not been identified. Look up 'Alon Rosen' in GoogleThis author has not been identified. Look up 'Gil Segev' in GoogleThis author has not been identified. Look up 'Ido Shahaf' in Google

runs on WebDSL