Sciweavers

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

30

STOC
2006
ACM

favoriteEmaildiscussreport

95views Algorithms» more STOC 2006»

Conditional hardness for approximate coloring

14 years 11 months ago

Conditional hardness for approximate coloring

Download www.stat.berkeley.edu

Irit Dinur, Elchanan Mossel, Oded Regev

Real-time Traffic

Algorithms | Conditional Hardness | STOC 2006 |

claim paper

Related Content

» Hardness of Approximate Hypergraph Coloring

» Conditional hardness for satisfiable 3CSPs

» Hard and soft constraints for reasoning about qualitative conditional preferences

» On the Hardness of Approximating the Network Coding Capacity

» Optimal color filter array design quantitative conditions and an efficient search procedur...

» Reasoning about soft constraints and conditional preferences complexity results and approx...

» An Efficient Upper Approximation for Conditional Preference

» Robust cost colorings

» Hardness of fully dense problems

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2006
Where	STOC
Authors	Irit Dinur, Elchanan Mossel, Oded Regev

Comments (0)