Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
Abstract
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
arrow_leftView TOC
Email/Printer Friendly Format  
 

Hardness amplification within NP

Oapos   Donnell, R.  
Appl. Math. Dept., MIT, MA;

This paper appears in: Computational Complexity, 2002. Proceedings. 17th IEEE Annual Conference on
Publication Date: 2002
On page(s): 13-13
Meeting Date: 05/21/2002 - 05/24/2002
Location: Montreal, Que., Canada
ISBN: 0-7695-1468-5
References Cited: 3
INSPEC Accession Number: 7329092
Digital Object Identifier: 10.1109/CCC.2002.1004332
Posted online: 2002-08-07 00:55:04.0

Abstract
We investigate whether, if NP is slightly hard on average, it is very hard on average

Index Terms
Available to subscribers and IEEE members.

References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
You must log in to access:
• Advanced or Author Search
• CrossRef Search
• AbstractPlus Records
• Full Text PDF
• Full Text HTML
Login
Username
Password
» Forgot your password?
Please remember to log out when you have finished your session.
Access this document
Full Text: PDF (232 KB)
» Buy this document now
»  Learn more about
» Learn more about
Download this citation
Available to subscribers and IEEE members.
 
arrow_leftView TOC   |  Back to toparrow_up
Indexed by IEE Inspec
© Copyright 2009 IEEE – All Rights Reserved