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
16
click to vote
STOC
1998
ACM
favorite
Email
discuss
report
115
views
Algorithms
»
more
STOC 1998
»
On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas
13 years 12 months ago
Download
www.cs.helsinki.fi
Paul Beame, Richard M. Karp, Toniann Pitassi, Mich
Real-time Traffic
Algorithms
|
STOC 1998
|
claim paper
Related Content
»
Unsatisfiable Linear CNF Formulas Are Large and Complex
»
The Efficiency of Resolution and DavisPutnam Procedures
»
Narrow proofs may be spacious separating space and width in resolution
»
Hardness Amplification in Proof Complexity
»
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Paramete...
»
A Probabilistic Algorithm for kSAT and Constraint Satisfaction Problems
»
On the Relative Merits of Simple Local Search Methods for the MAXSAT Problem
»
Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic
»
Model Counting A New Strategy for Obtaining Good Bounds
more »
Post Info
More Details (n/a)
Added
05 Aug 2010
Updated
05 Aug 2010
Type
Conference
Year
1998
Where
STOC
Authors
Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision