{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:49Z","timestamp":1725558409596},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642137303"},{"type":"electronic","value":"9783642137310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13731-0_17","type":"book-chapter","created":{"date-parts":[[2010,6,10]],"date-time":"2010-06-10T07:00:50Z","timestamp":1276153250000},"page":"164-175","source":"Crossref","is-referenced-by-count":13,"title":["Systems of Linear Equations over $\\mathbb{F}_2$ and Problems Parameterized above Average"],"prefix":"10.1007","author":[{"given":"Robert","family":"Crowston","sequence":"first","affiliation":[]},{"given":"Gregory","family":"Gutin","sequence":"additional","affiliation":[]},{"given":"Mark","family":"Jones","sequence":"additional","affiliation":[]},{"given":"Eun Jung","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Imre Z.","family":"Ruzsa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving MAX-r-SAT above a tight lower bound. Tech. Report arXiv:0907.4573. A priliminary version was published in Proc. ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, pp. 511\u2013517 (2010), \n                  \n                    http:\/\/arxiv.org\/abs\/0907.4573"},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.jalgor.2003.09.003","volume":"50","author":"N. Alon","year":"2004","unstructured":"Alon, N., Gutin, G., Krivelevich, M.: Algorithms with large domination ratio. J. Algorithms\u00a050, 118\u2013131 (2004)","journal-title":"J. Algorithms"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(01)00336-5","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math.\u00a0123, 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"17_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21652-2","volume-title":"Computational excursions in analysis and number theory","author":"P. Borwein","year":"2002","unstructured":"Borwein, P.: Computational excursions in analysis and number theory. Springer, New York (2002)"},{"key":"17_CR5","unstructured":"Crowston, R., Gutin, G., Jones, M.: Note on Max Lin-2 above average. Tech. Report, arXiv:0911.5384, \n                  \n                    http:\/\/arxiv.org\/abs\/0911.5384"},{"key":"17_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)"},{"key":"17_CR7","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-642-11269-0_19","volume-title":"Proc. IWPEC\u201909","author":"G. Gutin","year":"2009","unstructured":"Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: A probabilistic approach to problems parameterized above tight lower bound. In: Chen, J., Fomin, F.V. (eds.) Proc. IWPEC\u201909. LNCS, vol.\u00a05917, pp. 234\u2013245. Springer, Heidelberg (2009)"},{"key":"17_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04650-0","volume-title":"Extremal combinatorics: with applications in computer science","author":"S. Jukna","year":"2001","unstructured":"Jukna, S.: Extremal combinatorics: with applications in computer science. Springer, Heidelberg (2001)"},{"issue":"4","key":"17_CR10","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. H\u00e5stad","year":"2001","unstructured":"H\u00e5stad, J.: Some optimal inapproximability results. J. ACM\u00a048(4), 798\u2013859 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"17_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/rsa.20031","volume":"25","author":"J. H\u00e5stad","year":"2004","unstructured":"H\u00e5stad, J., Venkatesh, S.: On the advantage over a random assignment. Random Structures Algorithms\u00a025(2), 117\u2013149 (2004)","journal-title":"Random Structures Algorithms"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BF02579460","volume":"1","author":"D.J. Kleitman","year":"1981","unstructured":"Kleitman, D.J., Shearer, J.B., Sturtevant, D.: Intersection of k-element sets. Combinatorica\u00a01, 381\u2013384 (1981)","journal-title":"Combinatorica"},{"key":"17_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/11847250_4","volume-title":"Parameterized and Exact Computation","author":"M. Mahajan","year":"2006","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing MAX SNP problems above guaranteed values. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 38\u201349. Springer, Heidelberg (2006)"},{"issue":"2","key":"17_CR14","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M. Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Computer System Sciences\u00a075(2), 137\u2013153 (2009)","journal-title":"J. Computer System Sciences"},{"key":"17_CR15","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to fixed-parameter algorithms","author":"R. Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)"},{"key":"17_CR16","unstructured":"O\u2019Donnell, R.: Some topics in analysis of boolean functions. Technical report, ECCC Report TR08-055. Paper for an invited talk at STOC\u201908 (2008), \n                  \n                    http:\/\/www.eccc.uni-trier.de\/eccc-reports\/2008\/TR08-055\/"},{"key":"17_CR17","first-page":"1","volume":"1","author":"R. Wolf de","year":"2008","unstructured":"de Wolf, R.: A Brief Introduction to fourier analysis on the boolean cube. Theory Of Computing Library Graduate Surveys\u00a01, 1\u201320 (2008), \n                  \n                    http:\/\/theoryofcomputing.org","journal-title":"Theory Of Computing Library Graduate Surveys"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13731-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:11:13Z","timestamp":1619770273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13731-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642137303","9783642137310"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13731-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}