Sciweavers

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

18

STOC
1994
ACM

favoriteEmaildiscussreport

95views Algorithms» more STOC 1994»

Improved non-approximability results

13 years 8 months ago

Improved non-approximability results

Download people.csail.mit.edu

We indicate strong non-approximability factors for central problems: N1/4 for Max Clique; N1/10 for Chromatic Number; and 66/65 for Max 3SAT. Underlying the Max Clique result is a proof system in which the verifier examines only three "free bits" to attain an error of 1/2. Underlying the Chromatic Number result is a reduction from Max Clique which is more efficient than previous ones.

Mihir Bellare, Madhu Sudan

Real-time Traffic

Algorithms | Chromatic Number | Max Clique | STOC 1994 | Strong Non-approximability Factors |

claim paper

Related Content

» Free Bits PCPs and NonApproximability Towards Tight Results

» Advanced MeetintheMiddle Preimage Attacks First Results on Full Tiger and Improved Results...

» Wikipedia as Sense Inventory to Improve Diversity in Web Search Results

» An improved machine learning protocol for the identification of correct Sequest search res...

» Query Recommendation for Improving Search Engine Results

» Improving XML search by generating and utilizing informative result snippets

» Inducing Word Senses to Improve Web Search Result Clustering

» Randomized splay trees Theoretical and experimental results

» Theoretical and empirical results for recovery from multiple measurements

» Quantifier Scope Disambiguation Using Extracted Pragmatic Knowledge Preliminary Results

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1994
Where	STOC
Authors	Mihir Bellare, Madhu Sudan

Comments (0)