Verfügbarkeit: Computational complexity | Technische Universität München

Computational complexity:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Papadimitriou, Christos H. 1949- (VerfasserIn)
Format:	Buch
Sprache:	Englisch
Veröffentlicht:	Reading, Mass. u.a. Addison-Wesley 1994
Schlagwörter:	Kryptologie Turing-Maschine Komplexitätstheorie Algorithmus Boolesche Algebra Komplexität
Umfang:	XV, 523 S. graph. Darst.
ISBN:	0201530821

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV009533214
003	DE-604
005	19980213
007	t\|
008	940415s1994 xx d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0201530821 \|9 0-201-53082-1
035			\|a (OCoLC)246759945
035			\|a (DE-599)BVBBV009533214
040			\|a DE-604 \|b ger \|e rakddb
041	0		\|a eng
049			\|a DE-29T \|a DE-739 \|a DE-20 \|a DE-19 \|a DE-91G \|a DE-384 \|a DE-522 \|a DE-83 \|a DE-11 \|a DE-188 \|a DE-473
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 68Q15 \|2 msc
100	1		\|a Papadimitriou, Christos H. \|d 1949- \|e Verfasser \|0 (DE-588)135731909 \|4 aut
245	1	0	\|a Computational complexity \|c Christos H. Papadimitriou
264		1	\|a Reading, Mass. u.a. \|b Addison-Wesley \|c 1994
300			\|a XV, 523 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Kryptologie \|0 (DE-588)4033329-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
650	0	7	\|a Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Boolesche Algebra \|0 (DE-588)4146280-4 \|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 Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0		\|5 DE-604
689	1	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	1		\|8 1\p \|5 DE-604
689	2	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	2		\|8 2\p \|5 DE-604
689	3	0	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|D s
689	3		\|8 3\p \|5 DE-604
689	4	0	\|a Kryptologie \|0 (DE-588)4033329-2 \|D s
689	4		\|8 4\p \|5 DE-604
689	5	0	\|a Boolesche Algebra \|0 (DE-588)4146280-4 \|D s
689	5		\|8 5\p \|5 DE-604
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 2\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 3\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 4\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
883	1		\|8 5\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk
943	1		\|a oai:aleph.bib-bvb.de:BVB01-006295132

Datensatz im Suchindex

DE-BY-TUM_call_number	0102 DAT 517f 2001 A 26585
DE-BY-TUM_katkey	622816
DE-BY-TUM_location	01
DE-BY-TUM_media_number	040010812761
_version_	1821930991392915456
any_adam_object
author	Papadimitriou, Christos H. 1949-
author_GND	(DE-588)135731909
author_facet	Papadimitriou, Christos H. 1949-
author_role	aut
author_sort	Papadimitriou, Christos H. 1949-
author_variant	c h p ch chp
building	Verbundindex
bvnumber	BV009533214
classification_rvk	ST 130 ST 134
classification_tum	DAT 517f
ctrlnum	(OCoLC)246759945 (DE-599)BVBBV009533214
discipline	Informatik
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02285nam a2200577 c 4500</leader><controlfield tag="001">BV009533214</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19980213 </controlfield><controlfield tag="007">t\|</controlfield><controlfield tag="008">940415s1994 xx d\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0201530821</subfield><subfield code="9">0-201-53082-1</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)246759945</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009533214</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-29T</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-522</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-188</subfield><subfield code="a">DE-473</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">68Q15</subfield><subfield code="2">msc</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Papadimitriou, Christos H.</subfield><subfield code="d">1949-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)135731909</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computational complexity</subfield><subfield code="c">Christos H. Papadimitriou</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass. u.a.</subfield><subfield code="b">Addison-Wesley</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XV, 523 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="650" ind1="0" ind2="7"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Boolesche Algebra</subfield><subfield code="0">(DE-588)4146280-4</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Turing-Maschine</subfield><subfield code="0">(DE-588)4203525-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Kryptologie</subfield><subfield code="0">(DE-588)4033329-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Boolesche Algebra</subfield><subfield code="0">(DE-588)4146280-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006295132</subfield></datafield></record></collection>
id	DE-604.BV009533214
illustrated	Illustrated
indexdate	2024-12-20T09:37:52Z
institution	BVB
isbn	0201530821
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-006295132
oclc_num	246759945
open_access_boolean
owner	DE-29T DE-739 DE-20 DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-384 DE-522 DE-83 DE-11 DE-188 DE-473 DE-BY-UBG
owner_facet	DE-29T DE-739 DE-20 DE-19 DE-BY-UBM DE-91G DE-BY-TUM DE-384 DE-522 DE-83 DE-11 DE-188 DE-473 DE-BY-UBG
physical	XV, 523 S. graph. Darst.
publishDate	1994
publishDateSearch	1994
publishDateSort	1994
publisher	Addison-Wesley
record_format	marc
spellingShingle	Papadimitriou, Christos H. 1949- Computational complexity Kryptologie (DE-588)4033329-2 gnd Turing-Maschine (DE-588)4203525-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd Boolesche Algebra (DE-588)4146280-4 gnd Komplexität (DE-588)4135369-9 gnd
subject_GND	(DE-588)4033329-2 (DE-588)4203525-9 (DE-588)4120591-1 (DE-588)4001183-5 (DE-588)4146280-4 (DE-588)4135369-9
title	Computational complexity
title_auth	Computational complexity
title_exact_search	Computational complexity
title_full	Computational complexity Christos H. Papadimitriou
title_fullStr	Computational complexity Christos H. Papadimitriou
title_full_unstemmed	Computational complexity Christos H. Papadimitriou
title_short	Computational complexity
title_sort	computational complexity
topic	Kryptologie (DE-588)4033329-2 gnd Turing-Maschine (DE-588)4203525-9 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd Boolesche Algebra (DE-588)4146280-4 gnd Komplexität (DE-588)4135369-9 gnd
topic_facet	Kryptologie Turing-Maschine Komplexitätstheorie Algorithmus Boolesche Algebra Komplexität
work_keys_str_mv	AT papadimitriouchristosh computationalcomplexity

Verfügbarkeit

Bestellen (Login erforderlich)

Paper/Kapitel scannen lassen

Teilbibliothek Mathematik & Informatik

Bestandsangaben von Teilbibliothek Mathematik & Informatik
Signatur:	0102 DAT 517f 2001 A 26585 Lageplan
Exemplar 1	Ausleihbar Am Standort