Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
71
search results - page 15 / 15
»
Approximating Boolean Functions by OBDDs
Sort
relevance
views
votes
recent
update
View
thumb
title
14
click to vote
CC
2007
Springer
121
views
System Software
»
more
CC 2007
»
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
13 years 5 months ago
Download
www.cs.tau.ac.il
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
claim paper
Read More »
« Prev
« First
page 15 / 15
Last »
Next »