Counting, sampling and integrating: algorithms and complexity
Book information
Description
Text comprised of notes originating in a postgraduate lecture series given by the author at the ETH in Zurich in the Spring of 2000. Covers the counting of combinatorial structures and related topics, viewed from a computational perspective. Softcover.
Similar books
Handbook of Boolean Algebras (3 volumes)
DJVU
Конспект лекций по дискретной математике
Дискретная математика. Теория и практика
Дискретна математика. Навчальний посібник у двох частинах. Частина 1
Дискретная математика
Дискретная математика
Элементы дискретной математики в задачах