Author:
Crowston Robert,Gutin Gregory,Jones Mark,Raman Venkatesh,Saurabh Saket
Subject
General Computer Science,Theoretical Computer Science
Reference25 articles.
1. Solving MAX-r-SAT above a tight lower bound;Alon;Algorithmica,2011
2. The Probabilistic Method;Alon,2000
3. M. Charikar, V. Guruswami, R. Manokaran, Every permutation CSP of arity 3 is approximation resistant, in: Proc. Computational Complexity 2009, pp. 62–73.
4. Parameterized complexity of MaxSat above average;Crowston,2012
5. R. Crowston, G. Gutin, M. Jones, A. Yeo, A New Lower Bound on the Maximum Number of Satisfied Clauses in Max-SAT and Its Algorithmic Applications. Algorithmica, http://dx.doi.org/10.1007/s00453-011-9550-1.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献