Complexity: Knots, Colourings and Countings

Zusammenfassung These notes are based on a series of lectures given at the Advanced Research Institute of Discrete Applied Mathematics held at Rutgers University. Their aim is to link together algorithmic problems arising in knot theory! statistical physics and classical combinatorics. Inhaltsverzeichnis 1. The complexity of enumeration; 2. Knots and links; 3. Colourings, flows and polynomials; 4. Statistical physics; 5. Link polynomials; 6. Complexity questions; 7. The complexity of uniqueness and parity; 8. Approximation and randomisation; References.

Dettagli sul prodotto

• Autori: D. J. A. Welsh, Dominic Welsh, Dominic (University of Oxford) Welsh
• Editore: Cambridge University Press ELT
• Lingue: Inglese
• Formato: Tascabile
• Pubblicazione: 12.08.1993
• EAN: 9780521457408
• ISBN: 978-0-521-45740-8
• Pagine: 172
• Serie: London Mathematical Society Le
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Fondamenti