This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Alon N, Gutin G, Kim EJ, Szeider S, Yeo A (2011) Solving MAX-k-SAT above a tight lower bound. Algorithmica 61:638–655
Alon N, Gutin G, Krivelevich M (2004) Algorithms with large domination ratio. J Algorithms 50: 118–131
Crowston R, Fellows M, Gutin G, Jones M, Kim EJ, Rosamond F, Ruzsa IZ, Thomassé S, Yeo A (2014) Satisfying more than half of a system of linear equations over GF(2): a multivariate approach. J Comput Syst Sci 80:687–696
Crowston R, Gutin G, Jones M, Raman V, Saurabh S (2013) Parameterized complexity of MaxSat above average. Theor Comput Sci 511:77–84
Gutin G, Kim EJ, Szeider S, Yeo A (2011) A probabilistic approach to problems parameterized above tight lower bound. J Comput Syst Sci 77: 422–429
Kim EJ, Williams R (2012) Improved parameterized algorithms for above average constraint satisfaction. In: IPEC 2011, Saarbrücken. Lecture notes in computer science, vol 7112, pp 118–131
O’Donnell R (2008) Some topics in analysis of Boolean functions. Technical report, ECCC report TR08-055. Paper for an invited talk at STOC’08. www.eccc.uni-trier.de/eccc-reports/2008/TR08-055/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Gutin, G. (2016). Kernelization, Constraint Satisfaction Problems Parameterized above Average. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_524
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_524
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering