Invitation to Algorithmic Uses of Inclusion-Exclusion

I give an introduction to algorithmic uses of the principle of inclusion-exclusion. The presentation is intended to be be concrete and accessible, at the expense of generality and comprehensiveness.

[1]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[2]  Allan Gottlieb,et al.  A generating function approach to the Traveling Salesman Problem , 1977, ACM Annual Conference.

[3]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[4]  Richard M. Karp,et al.  Dynamic programming meets the principle of inclusion and exclusion , 1982, Oper. Res. Lett..

[5]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[6]  Richard J. Lipton,et al.  A Probabilistic Remark on Algebraic Program Testing , 1978, Inf. Process. Lett..

[7]  Andreas Björklund,et al.  Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings , 2007, Algorithmica.

[8]  Eugene L. Lawler,et al.  A Note on the Complexity of the Chromatic Number Problem , 1976, Inf. Process. Lett..

[9]  H. Ryser.  Combinatorial Mathematics: THE PRINCIPLE OF INCLUSION AND EXCLUSION , 1963 .

[10]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[11]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[12]  Andreas Björklund,et al.  Trimmed Moebius Inversion and Graphs of Bounded Degree , 2008, Theory of Computing Systems.

[13]  Andreas Björklund,et al.  Covering and packing in linear space , 2011, Inf. Process. Lett..

[14]  Jesper Nederlof.  Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems , 2009, ICALP.

[15]  Andreas Björklund,et al.  Set Partitioning via Inclusion-Exclusion , 2009, SIAM J. Comput..

[16]  Andreas Björklund,et al.  Fourier meets möbius: fast subset convolution , 2006, STOC '07.

[17]  Andreas Björklund,et al.  Evaluation of permanents in rings and semirings , 2010, Inf. Process. Lett..

[18]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[19]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .