Loading...
Please wait, while we are loading the content...
Similar Documents
if NP languages are hard in the worst-case then it is easy to find their hard instances (2005)
| Content Provider | CiteSeerX |
|---|---|
| Author | Gutfreund, Dan Shaltiel, Ronen Ta-Shma, Amnon |
| Description | In Proceedings of the 20th Annual IEEE Conference on Computational Complexity |
| File Format | |
| Language | English |
| Publisher Date | 2005-01-01 |
| Access Restriction | Open |
| Subject Keyword | Subject Classification Complexity Class Following Lemma Samplable Distribution Cryptography2 Gutfreund Algorithm Errs One-way Function Npcomplete Language Shaltiel Ta-shma Independent Interest Computational Difficulty Np Bpp Hard Instance Boolean Formula Probabilistic Polynomial-time Algorithm Sufficient Assumption Quasi-polynomial Time Fixed Distribution Pre-requisite Assumption Average-case Complexity First Worst-case Np Language Average-case Reduction |
| Content Type | Text |
| Resource Type | Article |