Combinatorics and complexity of partition functions / (Record no. 78477)

MARC details
000 -LEADER
fixed length control field 01652nam a22002537a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 220320b2017 |||||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9783319847511
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 512.73 BAR-A
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Barvinok, Alexander
245 ## - TITLE STATEMENT
Title Combinatorics and complexity of partition functions /
Statement of responsibility, etc. Alexander Barvinok
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. USA
Name of publisher, distributor, etc. Springer
Date of publication, distribution, etc. 2017
300 ## - PHYSICAL DESCRIPTION
Extent 303p.
365 ## - TRADE PRICE
Price type code EU
Price amount 84.99
440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Algorithms and combinatorics,
Volume/sequential designation v.30
500 ## - GENERAL NOTE
General note Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnia and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems. The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Combinatorial analysis
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Partitions (Mathematics)
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Mathematics
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Algorithms
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element System theory
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Approximation theory
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computer science--Mathematics
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Computational complexity
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
Holdings
Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Cost, normal purchase price Total Checkouts Full call number Barcode Date last seen Date last checked out Price effective from Koha item type Public note
  Dewey Decimal Classification     510 BITS Pilani Hyderabad BITS Pilani Hyderabad General Stack (For lending) 20/03/2022 84.99 1 512.73 BAR-A 44912 13/07/2024 04/04/2022 20/03/2022 Books RIG Project Book : Dr. Sajjith
An institution deemed to be a University Estd. Vide Sec.3 of the UGC
Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

© 2024 BITS-Library, BITS-Hyderabad, India.