Counting, Sampling and Integrating: Algorithms and Complexity (Lectures in Mathematics. ETH Zürich)

These notes had their origin in a postgraduate lecture series I gave at the Eid­ genossiche Technische Hochschule (ETH) in Zurich in the Spring of 2000. I am very grateful to my hosts, the Forschungsinstitut fUr Mathematik at ETH, for providing the ideal opportunity to develop and present this material in what I hope is a reasonably coherent manner, and also for encouraging and assisting me to record the proceedings in these lecture notes. The subject of the lecture series was counting (of combinatorial structures) and related topics, viewed from a computational perspective. As we shall see, "related topics" include sampling combinatorial structures (being computationally equivalent to approximate counting via efficient reductions), evaluating partition functions (being weighted counting) and calculating the volume of bodies (being counting in the limit). We shall be inhabiting a different world to the one conjured up by books with titles like Combinatorial Enumeration or Graphical Enumeration. There, the prob­ lems are usually parameterised on a single integer parameter n, and the required solutions are closed form or asymptotic estimates obtained using very refined and precise analytical tools.