Aspects of complexity :: minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 /
The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algori...
Gespeichert in:
| Weitere Verfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Berlin ; New York :
Walter de Gruyter,
2001.
|
| Schriftenreihe: | De Gruyter series in logic and its applications.
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Zusammenfassung: | The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals i. |
| Beschreibung: | 1 online resource (vi, 169 pages) : illustrations |
| Bibliographie: | Includes bibliographical references. |
| ISBN: | 9783110889178 311088917X |
Internformat
MARC
| LEADER | 00000cam a2200000Ma 4500 | ||
|---|---|---|---|
| 001 | ZDB-4-EBA-ocn815506880 | ||
| 003 | OCoLC | ||
| 005 | 20241004212047.0 | ||
| 006 | m o d | ||
| 007 | cr cn||||||||| | ||
| 008 | 010726s2001 gw a ob 100 0 eng d | ||
| 040 | |a E7B |b eng |e pn |c E7B |d OCLCO |d OCLCQ |d N$T |d OCLCF |d OCLCO |d DEBBG |d YDXCP |d MHW |d EBLCP |d OCLCO |d OCL |d OCLCO |d OCLCQ |d OCLCO |d COO |d OCLCQ |d DEBSZ |d AZK |d OCLCO |d COCUF |d AGLDB |d MOR |d MERUC |d OCLCQ |d ZCU |d U3W |d STF |d WRM |d VTS |d NRAMU |d ICG |d VT2 |d INT |d AU@ |d OCLCQ |d DKC |d OCLCQ |d AJS |d OCLCQ |d M8D |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 019 | |a 843635662 |a 961523601 |a 962704059 |a 974665943 |a 974769444 |a 1018049218 |a 1043627874 |a 1058387880 |a 1081284459 |a 1084423889 | ||
| 020 | |a 9783110889178 |q (electronic bk.) | ||
| 020 | |a 311088917X |q (electronic bk.) | ||
| 020 | |z 3110168103 |q (cloth ; |q alk. paper) | ||
| 020 | |z 9783110168105 | ||
| 024 | 7 | |a 10.1515/9783110889178 |2 doi | |
| 035 | |a (OCoLC)815506880 |z (OCoLC)843635662 |z (OCoLC)961523601 |z (OCoLC)962704059 |z (OCoLC)974665943 |z (OCoLC)974769444 |z (OCoLC)1018049218 |z (OCoLC)1043627874 |z (OCoLC)1058387880 |z (OCoLC)1081284459 |z (OCoLC)1084423889 | ||
| 050 | 4 | |a QA267.7 |b .A87 2001eb | |
| 072 | 7 | |a MAT |x 016000 |2 bisacsh | |
| 072 | 7 | |a MAT |x 018000 |2 bisacsh | |
| 082 | 7 | |a 511.3 |2 21 | |
| 049 | |a MAIN | ||
| 245 | 0 | 0 | |a Aspects of complexity : |b minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / |c editors Rod Downey, Denis Hirschfeldt. |
| 260 | |a Berlin ; |a New York : |b Walter de Gruyter, |c 2001. | ||
| 300 | |a 1 online resource (vi, 169 pages) : |b illustrations | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a data file | ||
| 490 | 1 | |a De Gruyter Series in Logic and Its Applications ; |v v. 4 | |
| 504 | |a Includes bibliographical references. | ||
| 520 | |a The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals i. | ||
| 505 | 0 | |a Preface -- Basic complexity -- Three lectures on real computation -- Parameterized complexity: new developments and research frontiers -- Kolmogorov complexity -- Complexity and computation in matrix groups -- The complexity of counting problems -- The ] conjecture -- List of contributors. | |
| 650 | 0 | |a Computational complexity |v Congresses. | |
| 650 | 0 | |a Machine theory |v Congresses. | |
| 650 | 6 | |a Complexité de calcul (Informatique) |v Congrès. | |
| 650 | 6 | |a Théorie des automates |v Congrès. | |
| 650 | 7 | |a MATHEMATICS |x Infinity. |2 bisacsh | |
| 650 | 7 | |a MATHEMATICS |x Logic. |2 bisacsh | |
| 650 | 7 | |a Computational complexity |2 fast | |
| 650 | 7 | |a Machine theory |2 fast | |
| 653 | 0 | |a Computational complexity / Congresses | |
| 653 | 0 | |a Machine theory / Congresses | |
| 655 | 7 | |a Conference papers and proceedings |2 fast | |
| 700 | 1 | |a Downey, R. G. |q (Rod G.) |1 https://id.oclc.org/worldcat/entity/E39PBJpTYxfKq6fbT6HCrPbmVC |0 http://id.loc.gov/authorities/names/n97054407 | |
| 700 | 1 | |a Hirschfeldt, Denis Roman. | |
| 758 | |i has work: |a Aspects of complexity (Text) |1 https://id.oclc.org/worldcat/entity/E39PCGfdQTXcYPcXFH9X3k6K7d |4 https://id.oclc.org/worldcat/ontology/hasWork | ||
| 776 | 0 | 8 | |i Print version: |z 9783110168105 |
| 830 | 0 | |a De Gruyter series in logic and its applications. |0 http://id.loc.gov/authorities/names/n99027177 | |
| 856 | 4 | 0 | |l FWS01 |p ZDB-4-EBA |q FWS_PDA_EBA |u https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=558736 |3 Volltext |
| 938 | |a EBL - Ebook Library |b EBLB |n EBL937935 | ||
| 938 | |a ebrary |b EBRY |n ebr10597936 | ||
| 938 | |a EBSCOhost |b EBSC |n 558736 | ||
| 938 | |a YBP Library Services |b YANK |n 9656605 | ||
| 994 | |a 92 |b GEBAY | ||
| 912 | |a ZDB-4-EBA | ||
| 049 | |a DE-863 | ||
Datensatz im Suchindex
| DE-BY-FWS_katkey | ZDB-4-EBA-ocn815506880 |
|---|---|
| _version_ | 1816882212603166720 |
| adam_text | |
| any_adam_object | |
| author2 | Downey, R. G. (Rod G.) Hirschfeldt, Denis Roman |
| author2_role | |
| author2_variant | r g d rg rgd d r h dr drh |
| author_GND | http://id.loc.gov/authorities/names/n97054407 |
| author_facet | Downey, R. G. (Rod G.) Hirschfeldt, Denis Roman |
| author_sort | Downey, R. G. |
| building | Verbundindex |
| bvnumber | localFWS |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 .A87 2001eb |
| callnumber-search | QA267.7 .A87 2001eb |
| callnumber-sort | QA 3267.7 A87 42001EB |
| callnumber-subject | QA - Mathematics |
| collection | ZDB-4-EBA |
| contents | Preface -- Basic complexity -- Three lectures on real computation -- Parameterized complexity: new developments and research frontiers -- Kolmogorov complexity -- Complexity and computation in matrix groups -- The complexity of counting problems -- The ] conjecture -- List of contributors. |
| ctrlnum | (OCoLC)815506880 |
| 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 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04146cam a2200649Ma 4500</leader><controlfield tag="001">ZDB-4-EBA-ocn815506880</controlfield><controlfield tag="003">OCoLC</controlfield><controlfield tag="005">20241004212047.0</controlfield><controlfield tag="006">m o d </controlfield><controlfield tag="007">cr cn|||||||||</controlfield><controlfield tag="008">010726s2001 gw a ob 100 0 eng d</controlfield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">E7B</subfield><subfield code="b">eng</subfield><subfield code="e">pn</subfield><subfield code="c">E7B</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">N$T</subfield><subfield code="d">OCLCF</subfield><subfield code="d">OCLCO</subfield><subfield code="d">DEBBG</subfield><subfield code="d">YDXCP</subfield><subfield code="d">MHW</subfield><subfield code="d">EBLCP</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCL</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">COO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DEBSZ</subfield><subfield code="d">AZK</subfield><subfield code="d">OCLCO</subfield><subfield code="d">COCUF</subfield><subfield code="d">AGLDB</subfield><subfield code="d">MOR</subfield><subfield code="d">MERUC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">ZCU</subfield><subfield code="d">U3W</subfield><subfield code="d">STF</subfield><subfield code="d">WRM</subfield><subfield code="d">VTS</subfield><subfield code="d">NRAMU</subfield><subfield code="d">ICG</subfield><subfield code="d">VT2</subfield><subfield code="d">INT</subfield><subfield code="d">AU@</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">DKC</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">AJS</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">M8D</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCQ</subfield><subfield code="d">OCLCO</subfield><subfield code="d">OCLCL</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">843635662</subfield><subfield code="a">961523601</subfield><subfield code="a">962704059</subfield><subfield code="a">974665943</subfield><subfield code="a">974769444</subfield><subfield code="a">1018049218</subfield><subfield code="a">1043627874</subfield><subfield code="a">1058387880</subfield><subfield code="a">1081284459</subfield><subfield code="a">1084423889</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783110889178</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">311088917X</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">3110168103</subfield><subfield code="q">(cloth ;</subfield><subfield code="q">alk. paper)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9783110168105</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9783110889178</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)815506880</subfield><subfield code="z">(OCoLC)843635662</subfield><subfield code="z">(OCoLC)961523601</subfield><subfield code="z">(OCoLC)962704059</subfield><subfield code="z">(OCoLC)974665943</subfield><subfield code="z">(OCoLC)974769444</subfield><subfield code="z">(OCoLC)1018049218</subfield><subfield code="z">(OCoLC)1043627874</subfield><subfield code="z">(OCoLC)1058387880</subfield><subfield code="z">(OCoLC)1081284459</subfield><subfield code="z">(OCoLC)1084423889</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA267.7</subfield><subfield code="b">.A87 2001eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">016000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT</subfield><subfield code="x">018000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="7" ind2=" "><subfield code="a">511.3</subfield><subfield code="2">21</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">MAIN</subfield></datafield><datafield tag="245" ind1="0" ind2="0"><subfield code="a">Aspects of complexity :</subfield><subfield code="b">minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 /</subfield><subfield code="c">editors Rod Downey, Denis Hirschfeldt.</subfield></datafield><datafield tag="260" ind1=" " ind2=" "><subfield code="a">Berlin ;</subfield><subfield code="a">New York :</subfield><subfield code="b">Walter de Gruyter,</subfield><subfield code="c">2001.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (vi, 169 pages) :</subfield><subfield code="b">illustrations</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">data file</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">De Gruyter Series in Logic and Its Applications ;</subfield><subfield code="v">v. 4</subfield></datafield><datafield tag="504" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references.</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals i.</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">Preface -- Basic complexity -- Three lectures on real computation -- Parameterized complexity: new developments and research frontiers -- Kolmogorov complexity -- Complexity and computation in matrix groups -- The complexity of counting problems -- The ] conjecture -- List of contributors.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Computational complexity</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Machine theory</subfield><subfield code="v">Congresses.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Complexité de calcul (Informatique)</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="6"><subfield code="a">Théorie des automates</subfield><subfield code="v">Congrès.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Infinity.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS</subfield><subfield code="x">Logic.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Computational complexity</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Machine theory</subfield><subfield code="2">fast</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Computational complexity / Congresses</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Machine theory / Congresses</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="a">Conference papers and proceedings</subfield><subfield code="2">fast</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Downey, R. G.</subfield><subfield code="q">(Rod G.)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PBJpTYxfKq6fbT6HCrPbmVC</subfield><subfield code="0">http://id.loc.gov/authorities/names/n97054407</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hirschfeldt, Denis Roman.</subfield></datafield><datafield tag="758" ind1=" " ind2=" "><subfield code="i">has work:</subfield><subfield code="a">Aspects of complexity (Text)</subfield><subfield code="1">https://id.oclc.org/worldcat/entity/E39PCGfdQTXcYPcXFH9X3k6K7d</subfield><subfield code="4">https://id.oclc.org/worldcat/ontology/hasWork</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="z">9783110168105</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">De Gruyter series in logic and its applications.</subfield><subfield code="0">http://id.loc.gov/authorities/names/n99027177</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="l">FWS01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FWS_PDA_EBA</subfield><subfield code="u">https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=558736</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBL - Ebook Library</subfield><subfield code="b">EBLB</subfield><subfield code="n">EBL937935</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">ebrary</subfield><subfield code="b">EBRY</subfield><subfield code="n">ebr10597936</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">EBSCOhost</subfield><subfield code="b">EBSC</subfield><subfield code="n">558736</subfield></datafield><datafield tag="938" ind1=" " ind2=" "><subfield code="a">YBP Library Services</subfield><subfield code="b">YANK</subfield><subfield code="n">9656605</subfield></datafield><datafield tag="994" ind1=" " ind2=" "><subfield code="a">92</subfield><subfield code="b">GEBAY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-863</subfield></datafield></record></collection> |
| genre | Conference papers and proceedings fast |
| genre_facet | Conference papers and proceedings |
| id | ZDB-4-EBA-ocn815506880 |
| illustrated | Illustrated |
| indexdate | 2024-11-27T13:25:01Z |
| institution | BVB |
| isbn | 9783110889178 311088917X |
| language | English |
| oclc_num | 815506880 |
| open_access_boolean | |
| owner | MAIN DE-863 DE-BY-FWS |
| owner_facet | MAIN DE-863 DE-BY-FWS |
| physical | 1 online resource (vi, 169 pages) : illustrations |
| psigel | ZDB-4-EBA |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Walter de Gruyter, |
| record_format | marc |
| series | De Gruyter series in logic and its applications. |
| series2 | De Gruyter Series in Logic and Its Applications ; |
| spelling | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / editors Rod Downey, Denis Hirschfeldt. Berlin ; New York : Walter de Gruyter, 2001. 1 online resource (vi, 169 pages) : illustrations text txt rdacontent computer c rdamedia online resource cr rdacarrier data file De Gruyter Series in Logic and Its Applications ; v. 4 Includes bibliographical references. The book contains 8 detailed expositions of the lectures given at the Kaikoura 2000 Workshop on Computability, Complexity, and Computational Algebra. Topics covered include basic models and questions of complexity theory, the Blum-Shub-Smale model of computation, probability theory applied to algorithmics (randomized alogrithms), parametric complexity, Kolmogorov complexity of finite strings, computational group theory, counting problems, and canonical models of ZFC providing a solution to continuum hypothesis. The text addresses students in computer science or mathematics, and professionals i. Preface -- Basic complexity -- Three lectures on real computation -- Parameterized complexity: new developments and research frontiers -- Kolmogorov complexity -- Complexity and computation in matrix groups -- The complexity of counting problems -- The ] conjecture -- List of contributors. Computational complexity Congresses. Machine theory Congresses. Complexité de calcul (Informatique) Congrès. Théorie des automates Congrès. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Computational complexity fast Machine theory fast Computational complexity / Congresses Machine theory / Congresses Conference papers and proceedings fast Downey, R. G. (Rod G.) https://id.oclc.org/worldcat/entity/E39PBJpTYxfKq6fbT6HCrPbmVC http://id.loc.gov/authorities/names/n97054407 Hirschfeldt, Denis Roman. has work: Aspects of complexity (Text) https://id.oclc.org/worldcat/entity/E39PCGfdQTXcYPcXFH9X3k6K7d https://id.oclc.org/worldcat/ontology/hasWork Print version: 9783110168105 De Gruyter series in logic and its applications. http://id.loc.gov/authorities/names/n99027177 FWS01 ZDB-4-EBA FWS_PDA_EBA https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=558736 Volltext |
| spellingShingle | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / De Gruyter series in logic and its applications. Preface -- Basic complexity -- Three lectures on real computation -- Parameterized complexity: new developments and research frontiers -- Kolmogorov complexity -- Complexity and computation in matrix groups -- The complexity of counting problems -- The ] conjecture -- List of contributors. Computational complexity Congresses. Machine theory Congresses. Complexité de calcul (Informatique) Congrès. Théorie des automates Congrès. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Computational complexity fast Machine theory fast |
| title | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / |
| title_auth | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / |
| title_exact_search | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / |
| title_full | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / editors Rod Downey, Denis Hirschfeldt. |
| title_fullStr | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / editors Rod Downey, Denis Hirschfeldt. |
| title_full_unstemmed | Aspects of complexity : minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / editors Rod Downey, Denis Hirschfeldt. |
| title_short | Aspects of complexity : |
| title_sort | aspects of complexity minicourses in algorithmics complexity and computational algebra mathematics workshop kaikoura january 7 15 2000 |
| title_sub | minicourses in algorithmics, complexity and computational algebra : mathematics workshop, Kaikoura, January 7-15, 2000 / |
| topic | Computational complexity Congresses. Machine theory Congresses. Complexité de calcul (Informatique) Congrès. Théorie des automates Congrès. MATHEMATICS Infinity. bisacsh MATHEMATICS Logic. bisacsh Computational complexity fast Machine theory fast |
| topic_facet | Computational complexity Congresses. Machine theory Congresses. Complexité de calcul (Informatique) Congrès. Théorie des automates Congrès. MATHEMATICS Infinity. MATHEMATICS Logic. Computational complexity Machine theory Conference papers and proceedings |
| url | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=558736 |
| work_keys_str_mv | AT downeyrg aspectsofcomplexityminicoursesinalgorithmicscomplexityandcomputationalalgebramathematicsworkshopkaikourajanuary7152000 AT hirschfeldtdenisroman aspectsofcomplexityminicoursesinalgorithmicscomplexityandcomputationalalgebramathematicsworkshopkaikourajanuary7152000 |