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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
114
click to vote
COCO
2003
Springer
64
views
Algorithms
»
more
COCO 2003
»
Proving SAT does not have Small Circuits with an Application to the Two
15 years 8 months ago
Download
people.cs.uchicago.edu
We show that if SAT does not have small circuits, then there must exist a small number of satisfiable formulas such that every small circuit fails to compute satisfiability corr...
Lance Fortnow, Aduri Pavan, Samik Sengupta
claim paper
Read More »