Complexité et décidabilité:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Französisch |
| Veröffentlicht: |
Paris u.a.
Springer
1993
|
| Schriftenreihe: | Mathématiques & applications
12 |
| Schlagwörter: | |
| Umfang: | 200 S. |
| ISBN: | 2287004165 3540568999 |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008403983 | ||
| 003 | DE-604 | ||
| 005 | 19940623 | ||
| 007 | t| | ||
| 008 | 931129s1993 xx |||| 00||| fre d | ||
| 020 | |a 2287004165 |9 2-287-00416-5 | ||
| 020 | |a 3540568999 |9 3-540-56899-9 | ||
| 035 | |a (OCoLC)30501676 | ||
| 035 | |a (DE-599)BVBBV008403983 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a fre | |
| 049 | |a DE-29T |a DE-739 |a DE-91G |a DE-703 |a DE-83 |a DE-11 |a DE-188 | ||
| 050 | 0 | |a QA267.7 | |
| 082 | 1 | |a 004.015 1 |2 22 | |
| 084 | |a SK 130 |0 (DE-625)143216: |2 rvk | ||
| 084 | |a DAT 542f |2 stub | ||
| 084 | |a DAT 517f |2 stub | ||
| 100 | 1 | |a Dehornoy, Patrick |d 1952-2019 |e Verfasser |0 (DE-588)113599625 |4 aut | |
| 245 | 1 | 0 | |a Complexité et décidabilité |c Patrick Dehornoy |
| 264 | 1 | |a Paris u.a. |b Springer |c 1993 | |
| 300 | |a 200 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Mathématiques & applications |v 12 | |
| 650 | 4 | |a Algorithmes | |
| 650 | 4 | |a Complexité de calcul (Informatique) | |
| 650 | 7 | |a Complexité de calcul (Informatique) |2 ram | |
| 650 | 4 | |a Turing, Machines de | |
| 650 | 7 | |a algorithme |2 inriac | |
| 650 | 7 | |a calcul booléen |2 inriac | |
| 650 | 7 | |a complexité |2 inriac | |
| 650 | 7 | |a décidabilité |2 inriac | |
| 650 | 7 | |a fonction récursive |2 inriac | |
| 650 | 7 | |a logique 1er ordre |2 inriac | |
| 650 | 7 | |a machine Turing |2 inriac | |
| 650 | 7 | |a théorie nombre |2 inriac | |
| 650 | 4 | |a Computational complexity | |
| 650 | 0 | 7 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexität |0 (DE-588)4135369-9 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 1 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexität |0 (DE-588)4135369-9 |D s |
| 689 | 1 | 1 | |a Entscheidbarkeit |0 (DE-588)4152398-2 |D s |
| 689 | 1 | |5 DE-604 | |
| 830 | 0 | |a Mathématiques & applications |v 12 |w (DE-604)BV006642035 |9 12 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005537145 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0102 DAT 542f 2001 A 12315 |
|---|---|
| DE-BY-TUM_katkey | 609075 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010690149 |
| _version_ | 1821930883547922432 |
| any_adam_object | |
| author | Dehornoy, Patrick 1952-2019 |
| author_GND | (DE-588)113599625 |
| author_facet | Dehornoy, Patrick 1952-2019 |
| author_role | aut |
| author_sort | Dehornoy, Patrick 1952-2019 |
| author_variant | p d pd |
| building | Verbundindex |
| bvnumber | BV008403983 |
| callnumber-first | Q - Science |
| callnumber-label | QA267 |
| callnumber-raw | QA267.7 |
| callnumber-search | QA267.7 |
| callnumber-sort | QA 3267.7 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | SK 130 |
| classification_tum | DAT 542f DAT 517f |
| ctrlnum | (OCoLC)30501676 (DE-599)BVBBV008403983 |
| dewey-full | 004.0151 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004.015 1 |
| dewey-search | 004.015 1 |
| dewey-sort | 14.015 11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02090nam a2200613 cb4500</leader><controlfield tag="001">BV008403983</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19940623 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">931129s1993 xx |||| 00||| fre d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">2287004165</subfield><subfield code="9">2-287-00416-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540568999</subfield><subfield code="9">3-540-56899-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30501676</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008403983</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">fre</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA267.7</subfield></datafield><datafield tag="082" ind1="1" ind2=" "><subfield code="a">004.015 1</subfield><subfield code="2">22</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 130</subfield><subfield code="0">(DE-625)143216:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Dehornoy, Patrick</subfield><subfield code="d">1952-2019</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)113599625</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexité et décidabilité</subfield><subfield code="c">Patrick Dehornoy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Paris u.a.</subfield><subfield code="b">Springer</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">200 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Mathématiques & applications</subfield><subfield code="v">12</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithmes</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité de calcul (Informatique)</subfield><subfield code="2">ram</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Turing, Machines de</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">algorithme</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">calcul booléen</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">complexité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">décidabilité</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">fonction récursive</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">logique 1er ordre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">machine Turing</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">théorie nombre</subfield><subfield code="2">inriac</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" ind2="0"><subfield code="a">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><subfield code="a">Entscheidbarkeit</subfield><subfield code="0">(DE-588)4152398-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Mathématiques & applications</subfield><subfield code="v">12</subfield><subfield code="w">(DE-604)BV006642035</subfield><subfield code="9">12</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005537145</subfield></datafield></record></collection> |
| id | DE-604.BV008403983 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:21:11Z |
| institution | BVB |
| isbn | 2287004165 3540568999 |
| language | French |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005537145 |
| oclc_num | 30501676 |
| open_access_boolean | |
| owner | DE-29T DE-739 DE-91G DE-BY-TUM DE-703 DE-83 DE-11 DE-188 |
| owner_facet | DE-29T DE-739 DE-91G DE-BY-TUM DE-703 DE-83 DE-11 DE-188 |
| physical | 200 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| publisher | Springer |
| record_format | marc |
| series | Mathématiques & applications |
| series2 | Mathématiques & applications |
| spellingShingle | Dehornoy, Patrick 1952-2019 Complexité et décidabilité Mathématiques & applications Algorithmes Complexité de calcul (Informatique) Complexité de calcul (Informatique) ram Turing, Machines de algorithme inriac calcul booléen inriac complexité inriac décidabilité inriac fonction récursive inriac logique 1er ordre inriac machine Turing inriac théorie nombre inriac Computational complexity Entscheidbarkeit (DE-588)4152398-2 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexität (DE-588)4135369-9 gnd |
| subject_GND | (DE-588)4152398-2 (DE-588)4134751-1 (DE-588)4135369-9 |
| title | Complexité et décidabilité |
| title_auth | Complexité et décidabilité |
| title_exact_search | Complexité et décidabilité |
| title_full | Complexité et décidabilité Patrick Dehornoy |
| title_fullStr | Complexité et décidabilité Patrick Dehornoy |
| title_full_unstemmed | Complexité et décidabilité Patrick Dehornoy |
| title_short | Complexité et décidabilité |
| title_sort | complexite et decidabilite |
| topic | Algorithmes Complexité de calcul (Informatique) Complexité de calcul (Informatique) ram Turing, Machines de algorithme inriac calcul booléen inriac complexité inriac décidabilité inriac fonction récursive inriac logique 1er ordre inriac machine Turing inriac théorie nombre inriac Computational complexity Entscheidbarkeit (DE-588)4152398-2 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexität (DE-588)4135369-9 gnd |
| topic_facet | Algorithmes Complexité de calcul (Informatique) Turing, Machines de algorithme calcul booléen complexité décidabilité fonction récursive logique 1er ordre machine Turing théorie nombre Computational complexity Entscheidbarkeit Berechnungskomplexität Komplexität |
| volume_link | (DE-604)BV006642035 |
| work_keys_str_mv | AT dehornoypatrick complexiteetdecidabilite |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik
| Signatur: |
0102 DAT 542f 2001 A 12315
Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |