Complexity of computations and proofs:
Gespeichert in:
Format: | Buch |
---|---|
Sprache: | English |
Veröffentlicht: |
Roma
Aracne
2004
|
Schriftenreihe: | Quaderni di matematica
13 |
Schlagworte: | |
Beschreibung: | 424 S. graph. Darst. |
ISBN: | 8879994131 |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV019994967 | ||
003 | DE-604 | ||
005 | 20060622 | ||
007 | t | ||
008 | 050810s2004 d||| |||| 00||| eng d | ||
020 | |a 8879994131 |9 88-7999-413-1 | ||
035 | |a (OCoLC)60367896 | ||
035 | |a (DE-599)BVBBV019994967 | ||
040 | |a DE-604 |b ger |e rakwb | ||
041 | 0 | |a eng | |
049 | |a DE-703 |a DE-83 | ||
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
084 | |a 68-06 |2 msc | ||
084 | |a 68Q19 |2 msc | ||
245 | 1 | 0 | |a Complexity of computations and proofs |c ed. by J. Krajíček |
264 | 1 | |a Roma |b Aracne |c 2004 | |
300 | |a 424 S. |b graph. Darst. | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 1 | |a Quaderni di matematica |v 13 | |
650 | 7 | |a Berekenbaarheid |2 gtt | |
650 | 7 | |a Bewijstheorie |2 gtt | |
650 | 7 | |a Complexiteit |2 gtt | |
650 | 7 | |a Computabilidade e complexidade |2 larpcal | |
650 | 4 | |a Coding theory | |
650 | 4 | |a Computational complexity | |
650 | 4 | |a Cryptography | |
650 | 4 | |a Kolmogorov complexity | |
650 | 4 | |a Proof theory | |
650 | 0 | 7 | |a Beweistheorie |0 (DE-588)4145177-6 |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 Kolmogorov-Komplexität |0 (DE-588)4164697-6 |2 gnd |9 rswk-swf |
655 | 7 | |0 (DE-588)4143413-4 |a Aufsatzsammlung |2 gnd-content | |
689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
689 | 0 | 1 | |a Beweistheorie |0 (DE-588)4145177-6 |D s |
689 | 0 | 2 | |a Kolmogorov-Komplexität |0 (DE-588)4164697-6 |D s |
689 | 0 | |5 DE-604 | |
700 | 1 | |a Krajíček, Jan |e Sonstige |4 oth | |
830 | 0 | |a Quaderni di matematica |v 13 |w (DE-604)BV017694587 |9 13 | |
999 | |a oai:aleph.bib-bvb.de:BVB01-013316793 |
Datensatz im Suchindex
_version_ | 1804133542984155136 |
---|---|
any_adam_object | |
building | Verbundindex |
bvnumber | BV019994967 |
classification_rvk | ST 134 |
ctrlnum | (OCoLC)60367896 (DE-599)BVBBV019994967 |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01717nam a2200517 cb4500</leader><controlfield tag="001">BV019994967</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20060622 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">050810s2004 d||| |||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">8879994131</subfield><subfield code="9">88-7999-413-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)60367896</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV019994967</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-703</subfield><subfield code="a">DE-83</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">68-06</subfield><subfield code="2">msc</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">68Q19</subfield><subfield code="2">msc</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Complexity of computations and proofs</subfield><subfield code="c">ed. by J. Krajíček</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Roma</subfield><subfield code="b">Aracne</subfield><subfield code="c">2004</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">424 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="1" ind2=" "><subfield code="a">Quaderni di matematica</subfield><subfield code="v">13</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">Bewijstheorie</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">Computabilidade e complexidade</subfield><subfield code="2">larpcal</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Coding theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Cryptography</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Kolmogorov complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Proof theory</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</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">Kolmogorov-Komplexität</subfield><subfield code="0">(DE-588)4164697-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4143413-4</subfield><subfield code="a">Aufsatzsammlung</subfield><subfield code="2">gnd-content</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">Beweistheorie</subfield><subfield code="0">(DE-588)4145177-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Kolmogorov-Komplexität</subfield><subfield code="0">(DE-588)4164697-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Krajíček, Jan</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Quaderni di matematica</subfield><subfield code="v">13</subfield><subfield code="w">(DE-604)BV017694587</subfield><subfield code="9">13</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-013316793</subfield></datafield></record></collection> |
genre | (DE-588)4143413-4 Aufsatzsammlung gnd-content |
genre_facet | Aufsatzsammlung |
id | DE-604.BV019994967 |
illustrated | Illustrated |
indexdate | 2024-07-09T20:10:23Z |
institution | BVB |
isbn | 8879994131 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-013316793 |
oclc_num | 60367896 |
open_access_boolean | |
owner | DE-703 DE-83 |
owner_facet | DE-703 DE-83 |
physical | 424 S. graph. Darst. |
publishDate | 2004 |
publishDateSearch | 2004 |
publishDateSort | 2004 |
publisher | Aracne |
record_format | marc |
series | Quaderni di matematica |
series2 | Quaderni di matematica |
spelling | Complexity of computations and proofs ed. by J. Krajíček Roma Aracne 2004 424 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Quaderni di matematica 13 Berekenbaarheid gtt Bewijstheorie gtt Complexiteit gtt Computabilidade e complexidade larpcal Coding theory Computational complexity Cryptography Kolmogorov complexity Proof theory Beweistheorie (DE-588)4145177-6 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Kolmogorov-Komplexität (DE-588)4164697-6 gnd rswk-swf (DE-588)4143413-4 Aufsatzsammlung gnd-content Berechnungskomplexität (DE-588)4134751-1 s Beweistheorie (DE-588)4145177-6 s Kolmogorov-Komplexität (DE-588)4164697-6 s DE-604 Krajíček, Jan Sonstige oth Quaderni di matematica 13 (DE-604)BV017694587 13 |
spellingShingle | Complexity of computations and proofs Quaderni di matematica Berekenbaarheid gtt Bewijstheorie gtt Complexiteit gtt Computabilidade e complexidade larpcal Coding theory Computational complexity Cryptography Kolmogorov complexity Proof theory Beweistheorie (DE-588)4145177-6 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Kolmogorov-Komplexität (DE-588)4164697-6 gnd |
subject_GND | (DE-588)4145177-6 (DE-588)4134751-1 (DE-588)4164697-6 (DE-588)4143413-4 |
title | Complexity of computations and proofs |
title_auth | Complexity of computations and proofs |
title_exact_search | Complexity of computations and proofs |
title_full | Complexity of computations and proofs ed. by J. Krajíček |
title_fullStr | Complexity of computations and proofs ed. by J. Krajíček |
title_full_unstemmed | Complexity of computations and proofs ed. by J. Krajíček |
title_short | Complexity of computations and proofs |
title_sort | complexity of computations and proofs |
topic | Berekenbaarheid gtt Bewijstheorie gtt Complexiteit gtt Computabilidade e complexidade larpcal Coding theory Computational complexity Cryptography Kolmogorov complexity Proof theory Beweistheorie (DE-588)4145177-6 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Kolmogorov-Komplexität (DE-588)4164697-6 gnd |
topic_facet | Berekenbaarheid Bewijstheorie Complexiteit Computabilidade e complexidade Coding theory Computational complexity Cryptography Kolmogorov complexity Proof theory Beweistheorie Berechnungskomplexität Kolmogorov-Komplexität Aufsatzsammlung |
volume_link | (DE-604)BV017694587 |
work_keys_str_mv | AT krajicekjan complexityofcomputationsandproofs |