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
SODA
2004
ACM
favorite
Email
discuss
report
94
views
Algorithms
»
more
SODA 2004
»
Improved upper bounds for 3-SAT
13 years 10 months ago
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
more »
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)
Researcher Info
Algorithms Study Group
Computer Vision