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
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
22
click to vote
STOC
2010
ACM
favorite
Email
discuss
report
159
views
Algorithms
»
more
STOC 2010
»
On the Complexity of Circuit Satisfiability
14 years 3 months ago
Download
www.math.cas.cz
Ramamohan Paturi and Pavel Pudl\ak
Real-time Traffic
Algorithms
|
STOC 2010
|
claim paper
Related Content
»
Combinational Equivalence Checking Using Satisfiability and Recursive Learning
»
Generalized Modal Satisfiability
»
Approximation of Natural WPComplete Minimisation Problems Is Hard
»
TimeSpace Tradeoffs for Satisfiability
»
QuteSAT a robust circuitbased SAT solver for complex circuit structure
»
Bidecomposing large Boolean functions via interpolation and satisfiability solving
»
On the Complexity of SAT
»
Towards an Efficient Tableau Method for Boolean Circuit Satisfiability Checking
»
Checking DelayInsensitivity 104 Gates and Beyond
more »
Post Info
More Details (n/a)
Added
09 Aug 2010
Updated
09 Aug 2010
Type
Conference
Year
2010
Where
STOC
Authors
Ramamohan Paturi and Pavel Pudl\ak
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision