×
Log in
Upload File
Most Popular
Study
Business
Design
Technology
Travel
Explore all categories
The top documents tagged [polynomially bounded]
1 NP-Complete Problems. 2 We discuss some hard problems: how hard? (computational complexity) what makes them hard? any solutions? Definitions
215 views
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
34 views
1 Authenticated Adversarial Routing Yair Amir, Paul Bunn, Rafail Ostrovsky 6 th IACR Theory of Cryptography Conference March 15, 2009
214 views