Combinatorics and complexity of partition functions:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Cham
Springer
[2016]
|
| Schriftenreihe: | Algorithms and combinatorics
volume 30 |
| Schlagworte: | |
| Online-Zugang: | BTU01 FHR01 FRO01 TUM01 UBM01 UBT01 UBW01 UEI01 UPA01 URL des Erstveröffentlichers |
| Beschreibung: | 1 Online-Ressource (VI, 303 Seiten, 51 illus., 42 illus. in color) |
| ISBN: | 9783319518299 |
| ISSN: | 0937-5511 |
| DOI: | 10.1007/978-3-319-51829-9 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV044256750 | ||
| 003 | DE-604 | ||
| 005 | 20220311 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 170403s2016 |||| o||u| ||||||eng d | ||
| 020 | |a 9783319518299 |c Online |9 978-3-319-51829-9 | ||
| 024 | 7 | |a 10.1007/978-3-319-51829-9 |2 doi | |
| 035 | |a (ZDB-2-SMA)9783319518299 | ||
| 035 | |a (OCoLC)981933107 | ||
| 035 | |a (DE-599)BVBBV044256750 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91 |a DE-19 |a DE-20 |a DE-739 |a DE-634 |a DE-898 |a DE-861 |a DE-703 |a DE-824 |a DE-83 | ||
| 082 | 0 | |a 511.352 |2 23 | |
| 084 | |a SK 170 |0 (DE-625)143221: |2 rvk | ||
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Barvinok, Alexander |d 1963- |e Verfasser |0 (DE-588)137398034 |4 aut | |
| 245 | 1 | 0 | |a Combinatorics and complexity of partition functions |c Alexander Barvinok |
| 264 | 1 | |a Cham |b Springer |c [2016] | |
| 300 | |a 1 Online-Ressource (VI, 303 Seiten, 51 illus., 42 illus. in color) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 1 | |a Algorithms and combinatorics |v volume 30 |x 0937-5511 | |
| 650 | 4 | |a Mathematics | |
| 650 | 4 | |a Computer science / Mathematics | |
| 650 | 4 | |a Approximation theory | |
| 650 | 4 | |a System theory | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Mathematics of Algorithmic Complexity | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Complex Systems | |
| 650 | 4 | |a Approximations and Expansions | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Mathematik | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 978-3-319-51828-2 |
| 830 | 0 | |a Algorithms and combinatorics |v volume 30 |w (DE-604)BV023819262 |9 30 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-319-51829-9 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SMA | ||
| 940 | 1 | |q ZDB-2-SMA_2016 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029661758 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l BTU01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l FHR01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l FRO01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l TUM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l UBM01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l UBT01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l UBW01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l UEI01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1007/978-3-319-51829-9 |l UPA01 |p ZDB-2-SMA |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804177429711814656 |
|---|---|
| any_adam_object | |
| author | Barvinok, Alexander 1963- |
| author_GND | (DE-588)137398034 |
| author_facet | Barvinok, Alexander 1963- |
| author_role | aut |
| author_sort | Barvinok, Alexander 1963- |
| author_variant | a b ab |
| building | Verbundindex |
| bvnumber | BV044256750 |
| classification_rvk | SK 170 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA |
| ctrlnum | (ZDB-2-SMA)9783319518299 (OCoLC)981933107 (DE-599)BVBBV044256750 |
| dewey-full | 511.352 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.352 |
| dewey-search | 511.352 |
| dewey-sort | 3511.352 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1007/978-3-319-51829-9 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02743nmm a2200637zcb4500</leader><controlfield tag="001">BV044256750</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220311 </controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">170403s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783319518299</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-319-51829-9</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-319-51829-9</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SMA)9783319518299</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)981933107</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV044256750</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-91</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-83</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 170</subfield><subfield code="0">(DE-625)143221:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Barvinok, Alexander</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)137398034</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Combinatorics and complexity of partition functions</subfield><subfield code="c">Alexander Barvinok</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham</subfield><subfield code="b">Springer</subfield><subfield code="c">[2016]</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (VI, 303 Seiten, 51 illus., 42 illus. in color)</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="1" ind2=" "><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">volume 30</subfield><subfield code="x">0937-5511</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science / Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">System theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematics of Algorithmic Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complex Systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximations and Expansions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematik</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-319-51828-2</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Algorithms and combinatorics</subfield><subfield code="v">volume 30</subfield><subfield code="w">(DE-604)BV023819262</subfield><subfield code="9">30</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-319-51829-9</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-2-SMA</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_2016</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029661758</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-319-51829-9</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">FHR01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">FRO01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">TUM01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">UBM01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">UBT01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">UBW01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">UEI01</subfield><subfield code="p">ZDB-2-SMA</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.1007/978-3-319-51829-9</subfield><subfield code="l">UPA01</subfield><subfield code="p">ZDB-2-SMA</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV044256750 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:47:56Z |
| institution | BVB |
| isbn | 9783319518299 |
| issn | 0937-5511 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029661758 |
| oclc_num | 981933107 |
| open_access_boolean | |
| owner | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-20 DE-739 DE-634 DE-898 DE-BY-UBR DE-861 DE-703 DE-824 DE-83 |
| owner_facet | DE-91 DE-BY-TUM DE-19 DE-BY-UBM DE-20 DE-739 DE-634 DE-898 DE-BY-UBR DE-861 DE-703 DE-824 DE-83 |
| physical | 1 Online-Ressource (VI, 303 Seiten, 51 illus., 42 illus. in color) |
| psigel | ZDB-2-SMA ZDB-2-SMA_2016 |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Springer |
| record_format | marc |
| series | Algorithms and combinatorics |
| series2 | Algorithms and combinatorics |
| spelling | Barvinok, Alexander 1963- Verfasser (DE-588)137398034 aut Combinatorics and complexity of partition functions Alexander Barvinok Cham Springer [2016] 1 Online-Ressource (VI, 303 Seiten, 51 illus., 42 illus. in color) txt rdacontent c rdamedia cr rdacarrier Algorithms and combinatorics volume 30 0937-5511 Mathematics Computer science / Mathematics Approximation theory System theory Algorithms Combinatorics Mathematics of Algorithmic Complexity Discrete Mathematics in Computer Science Complex Systems Approximations and Expansions Informatik Mathematik Erscheint auch als Druck-Ausgabe 978-3-319-51828-2 Algorithms and combinatorics volume 30 (DE-604)BV023819262 30 https://doi.org/10.1007/978-3-319-51829-9 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Barvinok, Alexander 1963- Combinatorics and complexity of partition functions Algorithms and combinatorics Mathematics Computer science / Mathematics Approximation theory System theory Algorithms Combinatorics Mathematics of Algorithmic Complexity Discrete Mathematics in Computer Science Complex Systems Approximations and Expansions Informatik Mathematik |
| title | Combinatorics and complexity of partition functions |
| title_auth | Combinatorics and complexity of partition functions |
| title_exact_search | Combinatorics and complexity of partition functions |
| title_full | Combinatorics and complexity of partition functions Alexander Barvinok |
| title_fullStr | Combinatorics and complexity of partition functions Alexander Barvinok |
| title_full_unstemmed | Combinatorics and complexity of partition functions Alexander Barvinok |
| title_short | Combinatorics and complexity of partition functions |
| title_sort | combinatorics and complexity of partition functions |
| topic | Mathematics Computer science / Mathematics Approximation theory System theory Algorithms Combinatorics Mathematics of Algorithmic Complexity Discrete Mathematics in Computer Science Complex Systems Approximations and Expansions Informatik Mathematik |
| topic_facet | Mathematics Computer science / Mathematics Approximation theory System theory Algorithms Combinatorics Mathematics of Algorithmic Complexity Discrete Mathematics in Computer Science Complex Systems Approximations and Expansions Informatik Mathematik |
| url | https://doi.org/10.1007/978-3-319-51829-9 |
| volume_link | (DE-604)BV023819262 |
| work_keys_str_mv | AT barvinokalexander combinatoricsandcomplexityofpartitionfunctions |