Normal view MARC view ISBD view

Combinatorics and Complexity of Partition Functions

511.352

Barvinok, Alexander. Combinatorics and Complexity of Partition Functions by Alexander Barvinok. -
VI, 303 p. 51 illus., 42 illus. in color. online resource. - (Algorithms and Combinatorics, 30) Content notes : Chapter I. Introduction -- Chapter II. Preliminaries -- Chapter III. Permanents -- Chapter IV. Hafnians and Multidimensional Permanents -- Chapter V. The Matching Polynomial -- Chapter VI. The Independence Polynomial -- Chapter VII. The Graph Homomorphism Partition Function -- Chapter VIII. Partition Functions of Integer Flows -- References -- Index. 9783319518299 * Combinatorics. Computational complexity. Algorithms. Mathematics. Mathematics of Algorithmic Complexity. Combinatorics. Discrete Mathematics in Computer Science. Complex Systems. Algorithms. Approximations and Expansions. * Series

Print
Add to your cart (remove)
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com)