Skip to main content

Table 2 Research history of FPT algorithms for MaxSAT

From: Parameterized algorithms of fundamental NP-hard problems: a survey

Year Time complexity References
1997 \(O^*(1.618^k)\) Raman and Mahajan [57]
1999 \(O^*(1.3995^k)\) Niedermeier and Rossmanith [60]
1999 \(O^*(1.380278^k)\) Bansal et al. [61]
2004 \(O^*(1.370^k)\) Chen et al. [62]
2012 \(O^*(1.358^k)\) Ivan et al. [63]