Complexity knots, colourings, and counting
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. Apart from the theory of comp...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
Cambridge
Cambridge University Press
1993
|
Schriftenreihe: | London Mathematical Society lecture note series
186 |
Schlagworte: | |
Online-Zugang: | BSB01 FHN01 URL des Erstveröffentlichers |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043941922 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 161206s1993 |||| o||u| ||||||eng d | ||
020 | |a 9780511752506 |c Online |9 978-0-511-75250-6 | ||
024 | 7 | |a 10.1017/CBO9780511752506 |2 doi | |
035 | |a (ZDB-20-CBO)CR9780511752506 | ||
035 | |a (OCoLC)907963412 | ||
035 | |a (DE-599)BVBBV043941922 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-12 |a DE-92 | ||
082 | 0 | |a 511.3 |2 20 | |
084 | |a SI 320 |0 (DE-625)143123: |2 rvk | ||
084 | |a SK 300 |0 (DE-625)143230: |2 rvk | ||
084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
100 | 1 | |a Welsh, D. J. A. |e Verfasser |4 aut | |
245 | 1 | 0 | |a Complexity |b knots, colourings, and counting |c D.J.A. Welsh |
246 | 1 | 3 | |a Complexity: Knots, Colourings & Countings |
264 | 1 | |a Cambridge |b Cambridge University Press |c 1993 | |
300 | |a 1 online resource (viii, 163 pages) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a London Mathematical Society lecture note series |v 186 | |
500 | |a Title from publisher's bibliographic system (viewed on 05 Oct 2015) | ||
520 | |a 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. Apart from the theory of computational complexity concerned with enumeration problems, introductions are given to several of the topics treated, such as combinatorial knot theory, randomised approximation algorithms, percolation and random cluster models. To researchers in discrete mathematics, computer science and statistical physics, this book will be of great interest, but any non-expert should find it an appealing guide to a very active area of research | ||
650 | 4 | |a Computational complexity | |
650 | 4 | |a Knot theory | |
650 | 4 | |a Combinatorial analysis | |
650 | 4 | |a Statistical physics | |
650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Enumeration |0 (DE-588)4242271-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Abzählen |0 (DE-588)4508960-7 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Kombinatorik |0 (DE-588)4031824-2 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Statistische Physik |0 (DE-588)4057000-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Knotentheorie |0 (DE-588)4164318-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Knoten |g Mathematik |0 (DE-588)4164314-8 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Knoten |g Mathematik |0 (DE-588)4164314-8 |D s |
689 | 0 | 1 | |a Enumeration |0 (DE-588)4242271-1 |D s |
689 | 0 | 2 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Abzählen |0 (DE-588)4508960-7 |D s |
689 | 1 | 1 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
689 | 2 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 2 | 1 | |a Kombinatorik |0 (DE-588)4031824-2 |D s |
689 | 2 | |8 3\p |5 DE-604 | |
689 | 3 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
689 | 3 | 1 | |a Knotentheorie |0 (DE-588)4164318-5 |D s |
689 | 3 | |8 4\p |5 DE-604 | |
689 | 4 | 0 | |a Statistische Physik |0 (DE-588)4057000-9 |D s |
689 | 4 | |8 5\p |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Druckausgabe |z 978-0-521-45740-8 |
856 | 4 | 0 | |u https://doi.org/10.1017/CBO9780511752506 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
912 | |a ZDB-20-CBO | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-029350892 | ||
883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
966 | e | |u https://doi.org/10.1017/CBO9780511752506 |l BSB01 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
966 | e | |u https://doi.org/10.1017/CBO9780511752506 |l FHN01 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext |
Datensatz im Suchindex
_version_ | 1804176884219510784 |
---|---|
any_adam_object | |
author | Welsh, D. J. A. |
author_facet | Welsh, D. J. A. |
author_role | aut |
author_sort | Welsh, D. J. A. |
author_variant | d j a w dja djaw |
building | Verbundindex |
bvnumber | BV043941922 |
classification_rvk | SI 320 SK 300 SK 890 |
collection | ZDB-20-CBO |
ctrlnum | (ZDB-20-CBO)CR9780511752506 (OCoLC)907963412 (DE-599)BVBBV043941922 |
dewey-full | 511.3 |
dewey-hundreds | 500 - Natural sciences and mathematics |
dewey-ones | 511 - General principles of mathematics |
dewey-raw | 511.3 |
dewey-search | 511.3 |
dewey-sort | 3511.3 |
dewey-tens | 510 - Mathematics |
discipline | Mathematik |
doi_str_mv | 10.1017/CBO9780511752506 |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04078nmm a2200805zcb4500</leader><controlfield tag="001">BV043941922</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">161206s1993 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780511752506</subfield><subfield code="c">Online</subfield><subfield code="9">978-0-511-75250-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/CBO9780511752506</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9780511752506</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)907963412</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043941922</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SI 320</subfield><subfield code="0">(DE-625)143123:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 300</subfield><subfield code="0">(DE-625)143230:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Welsh, D. J. A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity</subfield><subfield code="b">knots, colourings, and counting</subfield><subfield code="c">D.J.A. Welsh</subfield></datafield><datafield tag="246" ind1="1" ind2="3"><subfield code="a">Complexity: Knots, Colourings & Countings</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (viii, 163 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">London Mathematical Society lecture note series</subfield><subfield code="v">186</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 05 Oct 2015)</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">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. Apart from the theory of computational complexity concerned with enumeration problems, introductions are given to several of the topics treated, such as combinatorial knot theory, randomised approximation algorithms, percolation and random cluster models. To researchers in discrete mathematics, computer science and statistical physics, this book will be of great interest, but any non-expert should find it an appealing guide to a very active area of research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knot theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial analysis</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Statistical physics</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Enumeration</subfield><subfield code="0">(DE-588)4242271-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Abzählen</subfield><subfield code="0">(DE-588)4508960-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Statistische Physik</subfield><subfield code="0">(DE-588)4057000-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Knotentheorie</subfield><subfield code="0">(DE-588)4164318-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Knoten</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4164314-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Knoten</subfield><subfield code="g">Mathematik</subfield><subfield code="0">(DE-588)4164314-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Enumeration</subfield><subfield code="0">(DE-588)4242271-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Abzählen</subfield><subfield code="0">(DE-588)4508960-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Kombinatorik</subfield><subfield code="0">(DE-588)4031824-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2="1"><subfield code="a">Knotentheorie</subfield><subfield code="0">(DE-588)4164318-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Statistische Physik</subfield><subfield code="0">(DE-588)4057000-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druckausgabe</subfield><subfield code="z">978-0-521-45740-8</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/CBO9780511752506</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029350892</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511752506</subfield><subfield code="l">BSB01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/CBO9780511752506</subfield><subfield code="l">FHN01</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043941922 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:39:16Z |
institution | BVB |
isbn | 9780511752506 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029350892 |
oclc_num | 907963412 |
open_access_boolean | |
owner | DE-12 DE-92 |
owner_facet | DE-12 DE-92 |
physical | 1 online resource (viii, 163 pages) |
psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
publishDate | 1993 |
publishDateSearch | 1993 |
publishDateSort | 1993 |
publisher | Cambridge University Press |
record_format | marc |
series2 | London Mathematical Society lecture note series |
spelling | Welsh, D. J. A. Verfasser aut Complexity knots, colourings, and counting D.J.A. Welsh Complexity: Knots, Colourings & Countings Cambridge Cambridge University Press 1993 1 online resource (viii, 163 pages) txt rdacontent c rdamedia cr rdacarrier London Mathematical Society lecture note series 186 Title from publisher's bibliographic system (viewed on 05 Oct 2015) 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. Apart from the theory of computational complexity concerned with enumeration problems, introductions are given to several of the topics treated, such as combinatorial knot theory, randomised approximation algorithms, percolation and random cluster models. To researchers in discrete mathematics, computer science and statistical physics, this book will be of great interest, but any non-expert should find it an appealing guide to a very active area of research Computational complexity Knot theory Combinatorial analysis Statistical physics Komplexität (DE-588)4135369-9 gnd rswk-swf Enumeration (DE-588)4242271-1 gnd rswk-swf Abzählen (DE-588)4508960-7 gnd rswk-swf Kombinatorik (DE-588)4031824-2 gnd rswk-swf Statistische Physik (DE-588)4057000-9 gnd rswk-swf Knotentheorie (DE-588)4164318-5 gnd rswk-swf Knoten Mathematik (DE-588)4164314-8 gnd rswk-swf Knoten Mathematik (DE-588)4164314-8 s Enumeration (DE-588)4242271-1 s Komplexität (DE-588)4135369-9 s 1\p DE-604 Abzählen (DE-588)4508960-7 s 2\p DE-604 Kombinatorik (DE-588)4031824-2 s 3\p DE-604 Knotentheorie (DE-588)4164318-5 s 4\p DE-604 Statistische Physik (DE-588)4057000-9 s 5\p DE-604 Erscheint auch als Druckausgabe 978-0-521-45740-8 https://doi.org/10.1017/CBO9780511752506 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
spellingShingle | Welsh, D. J. A. Complexity knots, colourings, and counting Computational complexity Knot theory Combinatorial analysis Statistical physics Komplexität (DE-588)4135369-9 gnd Enumeration (DE-588)4242271-1 gnd Abzählen (DE-588)4508960-7 gnd Kombinatorik (DE-588)4031824-2 gnd Statistische Physik (DE-588)4057000-9 gnd Knotentheorie (DE-588)4164318-5 gnd Knoten Mathematik (DE-588)4164314-8 gnd |
subject_GND | (DE-588)4135369-9 (DE-588)4242271-1 (DE-588)4508960-7 (DE-588)4031824-2 (DE-588)4057000-9 (DE-588)4164318-5 (DE-588)4164314-8 |
title | Complexity knots, colourings, and counting |
title_alt | Complexity: Knots, Colourings & Countings |
title_auth | Complexity knots, colourings, and counting |
title_exact_search | Complexity knots, colourings, and counting |
title_full | Complexity knots, colourings, and counting D.J.A. Welsh |
title_fullStr | Complexity knots, colourings, and counting D.J.A. Welsh |
title_full_unstemmed | Complexity knots, colourings, and counting D.J.A. Welsh |
title_short | Complexity |
title_sort | complexity knots colourings and counting |
title_sub | knots, colourings, and counting |
topic | Computational complexity Knot theory Combinatorial analysis Statistical physics Komplexität (DE-588)4135369-9 gnd Enumeration (DE-588)4242271-1 gnd Abzählen (DE-588)4508960-7 gnd Kombinatorik (DE-588)4031824-2 gnd Statistische Physik (DE-588)4057000-9 gnd Knotentheorie (DE-588)4164318-5 gnd Knoten Mathematik (DE-588)4164314-8 gnd |
topic_facet | Computational complexity Knot theory Combinatorial analysis Statistical physics Komplexität Enumeration Abzählen Kombinatorik Statistische Physik Knotentheorie Knoten Mathematik |
url | https://doi.org/10.1017/CBO9780511752506 |
work_keys_str_mv | AT welshdja complexityknotscolouringsandcounting AT welshdja complexityknotscolouringscountings |