Abstract
A pseudorandom generator Gn :f0; 1g n !f0; 1g m is hard for a propositional proof system P if (roughly speaking) P cannot eciently
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
https://doi.org/10.4007/annals.2015.181.2.1
Journal: Annals of Mathematics | Publication Date: Mar 1, 2015 |
Citations: 81 |
A pseudorandom generator Gn :f0; 1g n !f0; 1g m is hard for a propositional proof system P if (roughly speaking) P cannot eciently
Join us for a 30 min session where you can share your feedback and ask us any queries you have