Invitation to Algorithmic Uses of Inclusion–Exclusion
From MaRDI portal
Publication:3012908
DOI10.1007/978-3-642-22012-8_3zbMath1333.68201OpenAlexW1962109247MaRDI QIDQ3012908
Publication date: 7 July 2011
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22012-8_3
Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (1)
Cites Work
- Unnamed Item
- Evaluation of permanents in rings and semirings
- Exact exponential algorithms.
- Exact algorithms for exact satisfiability and number of perfect matchings
- Dynamic programming meets the principle of inclusion and exclusion
- A note on the complexity of the chromatic number problem
- A probabilistic remark on algebraic program testing
- Trimmed Moebius inversion and graphs of bounded degree
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Fourier meets M\"{o}bius: fast subset convolution
- Set Partitioning via Inclusion-Exclusion
- Covering and Packing in Linear Space
- Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
This page was built for publication: Invitation to Algorithmic Uses of Inclusion–Exclusion