Invitation to algorithmic uses of inclusion–exclusion

Thore Husfeldt

doi:10.1007/978-3-642-22012-8_3

Invitation to algorithmic uses of inclusion–exclusion

Thore Husfeldt

Research output: Journal Article or Conference Article in Journal › Conference article › Research › peer-review

Abstract

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.

Original language	English
Book series	Lecture Notes in Computer Science
Volume	II
Pages (from-to)	42-59
Number of pages	17
ISSN	0302-9743
DOIs	https://doi.org/10.1007/978-3-642-22012-8_3
Publication status	Published - 2011

Keywords

Algorithmic Combinatorics
Inclusion-Exclusion Principle
Algorithmic Applications
Concrete Methods
Computational Mathematics

Access to Document

10.1007/978-3-642-22012-8_3

Cite this

@inproceedings{43a903d382aa4b6d8d272f4823def700,

title = "Invitation to algorithmic uses of inclusion–exclusion",

abstract = "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.",

keywords = "Algorithmic Combinatorics, Inclusion-Exclusion Principle, Algorithmic Applications, Concrete Methods, Computational Mathematics, Algorithmic Combinatorics, Inclusion-Exclusion Principle, Algorithmic Applications, Concrete Methods, Computational Mathematics",

author = "Thore Husfeldt",

year = "2011",

doi = "10.1007/978-3-642-22012-8\_3",

language = "English",

volume = "II",

pages = "42--59",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer",

}

TY - GEN

T1 - Invitation to algorithmic uses of inclusion–exclusion

AU - Husfeldt, Thore

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Algorithmic Combinatorics

KW - Inclusion-Exclusion Principle

KW - Algorithmic Applications

KW - Concrete Methods

KW - Computational Mathematics

KW - Algorithmic Combinatorics

KW - Inclusion-Exclusion Principle

KW - Algorithmic Applications

KW - Concrete Methods

KW - Computational Mathematics

U2 - 10.1007/978-3-642-22012-8_3

DO - 10.1007/978-3-642-22012-8_3

M3 - Conference article

SN - 0302-9743

VL - II

SP - 42

EP - 59

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

ER -

Invitation to algorithmic uses of inclusion–exclusion

Abstract

Keywords

Access to Document

Fingerprint

Cite this