Sciweavers

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

44

CORR
2008
Springer

99views Education» more CORR 2008»

Exponential-Time Approximation of Hard Problems

15 years 3 months ago

Exponential-Time Approximation of Hard Problems

Download www.mimuw.edu.pl

Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mat

Real-time Traffic

CORR 2008 | Education |

claim paper

Related Content

» On ExponentialTime Completeness of the Circularity Problem for Attribute Grammars

» An Exponential Time 2Approximation Algorithm for Bandwidth

» Algorithmics in Exponential Time

» The Complexity of the Covering Radius Problem on Lattices and Codes

» Finding a maximum likelihood tree is hard

» How Do You Like Your Equilibrium Selection Problems Hard or Very Hard

» A Random Constraint Satisfaction Problem That Seems Hard for DPLL

» Testing Expressibility Is Hard

» Hard constraint satisfaction problems have hard gaps at location 1

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CORR
Authors	Marek Cygan, Lukasz Kowalik, Marcin Pilipczuk, Mateusz Wykurz

Comments (0)