Sciweavers

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

8

FSTTCS
2008
Springer

favoriteEmaildiscussreport

106views Software Engineering» more FSTTCS 2008»

A new upper bound for 3-SAT

13 years 5 months ago

A new upper bound for 3-SAT

Download drops.dagstuhl.de

Josep Díaz, Lefteris M. Kirousis, Dieter Mi

Real-time Traffic

FSTTCS 2008 | Software Engineering |

claim paper

Related Content

» Non Uniform Selection of Solutions for Upper Bounding the 3SAT Threshold

» Typical random 3SAT formulae and the satisfiability threshold

» Improved upper bounds for 3SAT

» Exact Max 2Sat Easier and Faster

» Sums of squares based approximation algorithms for MAXSAT

» New Method for Upper Bounding the Maximum Average Linear Hull Probability for SPNs

» New upper bound formulas with parameters for Ramsey numbers

» New Upper Bounds for MaxSat

» New upper bounds on the Boolean circuit complexity of symmetric functions

Post Info
More Details (n/a)

Added	09 Nov 2010
Updated	09 Nov 2010
Type	Conference
Year	2008
Where	FSTTCS
Authors	Josep Díaz, Lefteris M. Kirousis, Dieter Mitsche, Xavier Pérez-Giménez

Comments (0)