Sciweavers

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

4

DAM
2002

favoriteEmaildiscussreport

57views more DAM 2002»

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion

13 years 4 months ago

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion

Download personal.stevens.edu

Douglas Bauer, Hajo Broersma, Aurora Morgana, Edwa

Real-time Traffic

DAM 2002 |

claim paper

Post Info
More Details (n/a)

Added	18 Dec 2010
Updated	18 Dec 2010
Type	Journal
Year	2002
Where	DAM
Authors	Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel

Comments (0)