Verfügbarkeit: Computational complexity

Computational complexity:

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Papadimitriou, Christos H. 1949- (VerfasserIn)
Format:	Buch
Sprache:	Undetermined
Veröffentlicht:	Reading, Mass. [u.a.] Addison-Wesley Publ. Co. 1994
Ausgabe:	1. print.
Schriftenreihe:	Theoretical computer science
Schlagworte:	Turing-Maschine Kryptologie Komplexität Boolesche Algebra Algorithmus Komplexitätstheorie
Beschreibung:	XV, 523 S. graph. Darst.
ISBN:	0201530821

Internformat

MARC


LEADER	00000nam a2200000zc 4500
001	BV021923830
003	DE-604
005	20040301000000.0
007	t
008	950314s1994 d\|\|\| \|\|\|\| 00\|\|\| und d
020			\|a 0201530821 \|9 0-201-53082-1
035			\|a (OCoLC)246759945
035			\|a (DE-599)BVBBV021923830
040			\|a DE-604 \|b ger
041			\|a und
049			\|a DE-706
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
084			\|a ST 134 \|0 (DE-625)143590: \|2 rvk
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
250			\|a 1. print.
264		1	\|a Reading, Mass. [u.a.] \|b Addison-Wesley Publ. Co. \|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
490	0		\|a Theoretical computer science
650	0	7	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|2 gnd \|9 rswk-swf
650	0	7	\|a Kryptologie \|0 (DE-588)4033329-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexität \|0 (DE-588)4135369-9 \|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 Algorithmus \|0 (DE-588)4001183-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|2 gnd \|9 rswk-swf
689	0	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	0		\|5 DE-604
689	1	0	\|a Kryptologie \|0 (DE-588)4033329-2 \|D s
689	1		\|5 DE-604
689	2	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	2		\|5 DE-604
689	3	0	\|a Boolesche Algebra \|0 (DE-588)4146280-4 \|D s
689	3		\|5 DE-604
689	4	0	\|a Turing-Maschine \|0 (DE-588)4203525-9 \|D s
689	4		\|5 DE-604
689	5	0	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	5		\|8 1\p \|5 DE-604
999			\|a oai:aleph.bib-bvb.de:BVB01-015138987
883	1		\|8 1\p \|a cgwrk \|d 20201028 \|q DE-101 \|u https://d-nb.info/provenance/plan#cgwrk

Datensatz im Suchindex

_version_	1804135878075875328
adam_txt
any_adam_object
any_adam_object_boolean
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	BV021923830
classification_rvk	ST 130 ST 134
ctrlnum	(OCoLC)246759945 (DE-599)BVBBV021923830
discipline	Informatik
discipline_str_mv	Informatik
edition	1. print.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01861nam a2200529zc 4500</leader><controlfield tag="001">BV021923830</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20040301000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950314s1994 d\|\|\| \|\|\|\| 00\|\|\| und 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)BVBBV021923830</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">und</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</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="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="250" ind1=" " ind2=" "><subfield code="a">1. print.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Reading, Mass. [u.a.]</subfield><subfield code="b">Addison-Wesley Publ. Co.</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="490" ind1="0" ind2=" "><subfield code="a">Theoretical computer science</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">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">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="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">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">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="689" ind1="0" 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="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><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="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" 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="3" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" 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="4" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-015138987</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></record></collection>
id	DE-604.BV021923830
illustrated	Illustrated
index_date	2024-07-02T16:05:52Z
indexdate	2024-07-09T20:47:30Z
institution	BVB
isbn	0201530821
language	Undetermined
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-015138987
oclc_num	246759945
open_access_boolean
owner	DE-706
owner_facet	DE-706
physical	XV, 523 S. graph. Darst.
publishDate	1994
publishDateSearch	1994
publishDateSort	1994
publisher	Addison-Wesley Publ. Co.
record_format	marc
series2	Theoretical computer science
spelling	Papadimitriou, Christos H. 1949- Verfasser (DE-588)135731909 aut Computational complexity Christos H. Papadimitriou 1. print. Reading, Mass. [u.a.] Addison-Wesley Publ. Co. 1994 XV, 523 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Theoretical computer science Turing-Maschine (DE-588)4203525-9 gnd rswk-swf Kryptologie (DE-588)4033329-2 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Boolesche Algebra (DE-588)4146280-4 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 s DE-604 Kryptologie (DE-588)4033329-2 s Komplexität (DE-588)4135369-9 s Boolesche Algebra (DE-588)4146280-4 s Turing-Maschine (DE-588)4203525-9 s Komplexitätstheorie (DE-588)4120591-1 s 1\p DE-604 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Papadimitriou, Christos H. 1949- Computational complexity Turing-Maschine (DE-588)4203525-9 gnd Kryptologie (DE-588)4033329-2 gnd Komplexität (DE-588)4135369-9 gnd Boolesche Algebra (DE-588)4146280-4 gnd Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd
subject_GND	(DE-588)4203525-9 (DE-588)4033329-2 (DE-588)4135369-9 (DE-588)4146280-4 (DE-588)4001183-5 (DE-588)4120591-1
title	Computational complexity
title_auth	Computational complexity
title_exact_search	Computational complexity
title_exact_search_txtP	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	Turing-Maschine (DE-588)4203525-9 gnd Kryptologie (DE-588)4033329-2 gnd Komplexität (DE-588)4135369-9 gnd Boolesche Algebra (DE-588)4146280-4 gnd Algorithmus (DE-588)4001183-5 gnd Komplexitätstheorie (DE-588)4120591-1 gnd
topic_facet	Turing-Maschine Kryptologie Komplexität Boolesche Algebra Algorithmus Komplexitätstheorie
work_keys_str_mv	AT papadimitriouchristosh computationalcomplexity

Verfügbarkeit

Es ist kein Print-Exemplar vorhanden.

Fernleihe Bestellen Achtung: Nicht im THWS-Bestand!

MARC

Datensatz im Suchindex

Es ist kein Print-Exemplar vorhanden.

Ähnliche Einträge