If NP languages are hard on the worst-case then it is easy to find their hard instances

Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Fingerprint

Dive into the research topics of 'If NP languages are hard on the worst-case then it is easy to find their hard instances'. Together they form a unique fingerprint.

Mathematics

Engineering & Materials Science