MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Hardness Amplification within NP." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 11 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Professional Experience  
  • by Parikshit Gopalan, Advisor Prof, Richard J. Lipton, Host Prof, Venkatesan Guruswami
  • …. Conferences C1 Parikshit Gopalan and Venkatesan Guruswami. Hardness Amplification within NP against…
  • Add To MetaCart
  • Hardness amplification proofs require majority  
  • by Ronen Shaltiel, Emanuele Viola — 2008 — In Proceedings of the 40th Annual ACM Symposium on the Theory of Computing (STOC
  • …-uniformity (e.g. |D| = poly(1/ɛ)) is important for achieving “uniform hardness amplification within NP…
  • Cited by 1 (1 self) – Add To MetaCart
  • On Constructing Parallel Pseudorandom Generators  
  • by From One-Way Functions, Emanuele Viola — 2005 — In Proc. 20th Conference on Computational Complexity (CCC
  • … [BT], building on [FF], show that every hardness amplification within NP such that its proof…
  • Add To MetaCart
  • Finding Pessiland ⋆ Hoeteck Wee  
  • by Computer Science Division
  • …] on hardness amplification within NP relativizes, we may deduce that there is a strongly hard…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB