Confronting hardness using a hybrid approach

Virginia Vassilevska, Ryan Williams, Shan Leung Maverick Woo · 2006

1 Introduction Motivation. Ever since the foundation of NP-completeness was laid down by Cook, Levin and other pioneers in the 1970s, our community has devised a number of algorithmic strategies to cope with hardness results.

Read the paper · More papers on PaperTik