Systems of linear equations over double-struck F2 and problems parameterized above average

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6139 LNCS, Issue , 2010, Pages 164-175

  Crowston, Robert ^a   Gutin, Gregory ^a   Jones, Mark ^a   Kim, Eun Jung ^a   Ruzsa, Imre Z ^b  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC APPROACHES; FOURIER EXPANSION; LOWER BOUNDS; MULTISET; PARAMETERIZED; PARAMETERIZED COMPLEXITY; POLYNOMIAL-TIME; PSEUDO-BOOLEAN FUNCTION; SYSTEMS OF LINEAR EQUATIONS; TIME ALGORITHMS; TRUTH ASSIGNMENT; TWO EQUATION;

ALGORITHMS; LINEAR EQUATIONS; PARAMETERIZATION;

BOOLEAN FUNCTIONS;

EID: 77954652975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13731-0_17     Document Type: Conference Paper

References (17)

1. 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-517 (2010), http://arxiv.org/abs/0907.4573
2. Alon, N., Gutin, G., Krivelevich, M.: Algorithms with large domination ratio. J. Algorithms 50, 118-131 (2004)
3. Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123, 155-225 (2002)
4. Borwein, P.: Computational excursions in analysis and number theory. Springer, New York (2002)
5. Crowston, R., Gutin, G., Jones, M.: Note on Max Lin-2 above average. Tech. Report, arXiv:0911.5384, http://arxiv.org/abs/0911.5384
6. Downey, R.G., Fellows, M.R.: Parameterized complexity. Springer, Heidelberg (1999)
7. Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Heidelberg (2006)
8. 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'09. LNCS, vol. 5917, pp. 234-245. Springer, Heidelberg (2009)
9. Jukna, S.: Extremal combinatorics: with applications in computer science. Springer, Heidelberg (2001)
10. Håastad, J.: Some optimal inapproximability results. J. ACM 48(4), 798-859 (2001)
11. Håastad, J., Venkatesh, S.: On the advantage over a random assignment. Random Structures Algorithms 25(2), 117-149 (2004)
12. Kleitman, D.J., Shearer, J.B., Sturtevant, D.: Intersection of k-element sets. Combinatorica 1, 381-384 (1981)
13. 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. 4169, pp. 38-49. Springer, Heidelberg (2006)
14. Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Computer System Sciences 75(2), 137-153 (2009)
15. Niedermeier, R.: Invitation to fixed-parameter algorithms. Oxford University Press, Oxford (2006)
16. O'Donnell, R.: Some topics in analysis of boolean functions. Technical report, ECCC Report TR08-055. Paper for an invited talk at STOC'08 (2008), http://www.eccc.uni-trier.de/eccc-reports/2008/TR08-055/
17. de Wolf, R.: A Brief Introduction to fourier analysis on the boolean cube. Theory Of Computing Library Graduate Surveys 1, 1-20 (2008), http://theoryofcomputing.org