Computability and complexity: from a programming perspective
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Buch |
Sprache: | English |
Veröffentlicht: |
Cambridge, Mass. [u.a.]
MIT Pr.
1997
|
Schriftenreihe: | Foundations of computing
|
Schlagworte: | |
Beschreibung: | XVI, 466 S. graph. Darst. |
ISBN: | 0262100649 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV011394436 | ||
003 | DE-604 | ||
005 | 19980805 | ||
007 | t | ||
008 | 970623s1997 d||| |||| 00||| eng d | ||
020 | |a 0262100649 |9 0-262-10064-9 | ||
035 | |a (OCoLC)35723572 | ||
035 | |a (DE-599)BVBBV011394436 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-739 |a DE-703 |a DE-20 |a DE-91G |a DE-19 |a DE-634 |a DE-83 |a DE-11 |a DE-29T | ||
050 | 0 | |a QA76.6 | |
082 | 0 | |a 005.13/1 |2 21 | |
084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a DAT 517f |2 stub | ||
084 | |a DAT 542f |2 stub | ||
100 | 1 | |a Jones, Neil D. |d 1941- |e Verfasser |0 (DE-588)124574521 |4 aut | |
245 | 1 | 0 | |a Computability and complexity |b from a programming perspective |c Neil D. Jones |
264 | 1 | |a Cambridge, Mass. [u.a.] |b MIT Pr. |c 1997 | |
300 | |a XVI, 466 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a Foundations of computing | |
650 | 7 | |a Berekenbaarheid |2 gtt | |
650 | 7 | |a Complexiteit |2 gtt | |
650 | 7 | |a Complexité algorithmique |2 rasuqam | |
650 | 4 | |a Complexité de calcul (Informatique) | |
650 | 7 | |a Fundamentele informatica |2 gtt | |
650 | 7 | |a Modèle de calcul |2 rasuqam | |
650 | 4 | |a Programmation (Informatique) | |
650 | 7 | |a Programmation |2 rasuqam | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Computer programming | |
650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Berechnungstheorie |0 (DE-588)4005581-4 |D s |
689 | 0 | |5 DE-604 | |
689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
689 | 1 | |5 DE-604 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-007659428 |
Datensatz im Suchindex
_version_ | 1804125907224363008 |
---|---|
any_adam_object | |
author | Jones, Neil D. 1941- |
author_GND | (DE-588)124574521 |
author_facet | Jones, Neil D. 1941- |
author_role | aut |
author_sort | Jones, Neil D. 1941- |
author_variant | n d j nd ndj |
building | Verbundindex |
bvnumber | BV011394436 |
callnumber-first | Q - Science |
callnumber-label | QA76 |
callnumber-raw | QA76.6 |
callnumber-search | QA76.6 |
callnumber-sort | QA 276.6 |
callnumber-subject | QA - Mathematics |
classification_rvk | ST 130 ST 134 |
classification_tum | DAT 517f DAT 542f |
ctrlnum | (OCoLC)35723572 (DE-599)BVBBV011394436 |
dewey-full | 005.13/1 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.13/1 |
dewey-search | 005.13/1 |
dewey-sort | 15.13 11 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01797nam a2200529 c 4500</leader><controlfield tag="001">BV011394436</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980805 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">970623s1997 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0262100649</subfield><subfield code="9">0-262-10064-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)35723572</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011394436</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-739</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-29T</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13/1</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 130</subfield><subfield code="0">(DE-625)143588:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 542f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Jones, Neil D.</subfield><subfield code="d">1941-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)124574521</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and complexity</subfield><subfield code="b">from a programming perspective</subfield><subfield code="c">Neil D. Jones</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Mass. [u.a.]</subfield><subfield code="b">MIT Pr.</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XVI, 466 S.</subfield><subfield code="b">graph. Darst.</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="0" ind2=" "><subfield code="a">Foundations of computing</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berekenbaarheid</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexité algorithmique</subfield><subfield code="2">rasuqam</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">Fundamentele informatica</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Modèle de calcul</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Informatique)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programmation</subfield><subfield code="2">rasuqam</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</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ätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007659428</subfield></datafield></record></collection> |
id | DE-604.BV011394436 |
illustrated | Illustrated |
indexdate | 2024-07-09T18:09:01Z |
institution | BVB |
isbn | 0262100649 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007659428 |
oclc_num | 35723572 |
open_access_boolean | |
owner | DE-739 DE-703 DE-20 DE-91G DE-BY-TUM DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-29T |
owner_facet | DE-739 DE-703 DE-20 DE-91G DE-BY-TUM DE-19 DE-BY-UBM DE-634 DE-83 DE-11 DE-29T |
physical | XVI, 466 S. graph. Darst. |
publishDate | 1997 |
publishDateSearch | 1997 |
publishDateSort | 1997 |
publisher | MIT Pr. |
record_format | marc |
series2 | Foundations of computing |
spelling | Jones, Neil D. 1941- Verfasser (DE-588)124574521 aut Computability and complexity from a programming perspective Neil D. Jones Cambridge, Mass. [u.a.] MIT Pr. 1997 XVI, 466 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Foundations of computing Berekenbaarheid gtt Complexiteit gtt Complexité algorithmique rasuqam Complexité de calcul (Informatique) Fundamentele informatica gtt Modèle de calcul rasuqam Programmation (Informatique) Programmation rasuqam Computational complexity Computer programming Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s |
spellingShingle | Jones, Neil D. 1941- Computability and complexity from a programming perspective Berekenbaarheid gtt Complexiteit gtt Complexité algorithmique rasuqam Complexité de calcul (Informatique) Fundamentele informatica gtt Modèle de calcul rasuqam Programmation (Informatique) Programmation rasuqam Computational complexity Computer programming Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungstheorie (DE-588)4005581-4 gnd |
subject_GND | (DE-588)4120591-1 (DE-588)4005581-4 |
title | Computability and complexity from a programming perspective |
title_auth | Computability and complexity from a programming perspective |
title_exact_search | Computability and complexity from a programming perspective |
title_full | Computability and complexity from a programming perspective Neil D. Jones |
title_fullStr | Computability and complexity from a programming perspective Neil D. Jones |
title_full_unstemmed | Computability and complexity from a programming perspective Neil D. Jones |
title_short | Computability and complexity |
title_sort | computability and complexity from a programming perspective |
title_sub | from a programming perspective |
topic | Berekenbaarheid gtt Complexiteit gtt Complexité algorithmique rasuqam Complexité de calcul (Informatique) Fundamentele informatica gtt Modèle de calcul rasuqam Programmation (Informatique) Programmation rasuqam Computational complexity Computer programming Komplexitätstheorie (DE-588)4120591-1 gnd Berechnungstheorie (DE-588)4005581-4 gnd |
topic_facet | Berekenbaarheid Complexiteit Complexité algorithmique Complexité de calcul (Informatique) Fundamentele informatica Modèle de calcul Programmation (Informatique) Programmation Computational complexity Computer programming Komplexitätstheorie Berechnungstheorie |
work_keys_str_mv | AT jonesneild computabilityandcomplexityfromaprogrammingperspective |