Author:
Applebaum Benny,Bogdanov Andrej,Rosen Alon
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference31 articles.
1. M. Alekhnovich, More on average case vs approximation complexity, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (2003), pp. 298–307
2. M. Alekhnovich, E. Ben-Sasson, A.A. Razborov, A. Wigderson, Pseudorandom generators in propositional proof complexity. SIAM Journal of Computation 34(1):67–88, 2004
3. M. Alekhnovich, E. A. Hirsch, D. Itsykson, Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas. J. Autom. Reasoning 35(1–3):51–72, 2005
4. B. Applebaum, Pseudorandom generators with long stretch and low locality from random local one-way functions. SIAM Journal of Computation 42(5):2008–2037, 2013.
5. B. Applebaum, B. Barak, A. Wigderson, Public-key cryptography from different assumptions, in 42nd ACM Symposium on Theory of Computing (STOC 2010) (2010), pp. 171–180
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献