Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

108

Voted

STOC
2010
ACM

159views Algorithms» more STOC 2010»

On the Complexity of Circuit Satisfiability

15 years 6 months ago

On the Complexity of Circuit Satisfiability

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

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)