Sciweavers

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

88

Voted

SODA
2004
ACM

94views Algorithms» more SODA 2004»

Improved upper bounds for 3-SAT

15 years 4 months ago

Improved upper bounds for 3-SAT

Download www.inf.ethz.ch

Kazuo Iwama, Suguru Tamaki

Real-time Traffic

Algorithms | SODA 2004 |

claim paper

Related Content

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

» A new upper bound for 3SAT

» Typical random 3SAT formulae and the satisfiability threshold

» Exact Max 2Sat Easier and Faster

» Improved algorithms for 3coloring 3edgecoloring and constraint satisfaction

» Improved upper bounds on sizes of codes

» Sums of squares based approximation algorithms for MAXSAT

» Improved upper and lower bounds on the feedback vertex numbers of grids and butterflies

» Improved Upper Bound for the Redundancy of FixFree Codes

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	SODA
Authors	Kazuo Iwama, Suguru Tamaki

Comments (0)