Holdings: Computational complexity

Computational complexity:

Saved in:

Bibliographic Details
Main Author:	Papadimitriou, Christos H. 1949- (Author)
Format:	Book
Language:	English
Published:	Reading, Mass. [u.a.] Addison-Wesley 1995
Edition:	Reprint. with corr.
Subjects:	Complexité de calcul (Informatique) Computational complexity Komplexitätstheorie Boolesche Algebra Turing-Maschine Kryptologie Komplexität Algorithmus
Online Access:	Inhaltsverzeichnis
Physical Description:	XV, 523 S. graph. Darst.
ISBN:	0201530821

Staff View

MARC


LEADER	00000nam a2200000 c 4500
001	BV011027783
003	DE-604
005	20130725
007	t
008	961029s1995 d\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0201530821 \|9 0-201-53082-1
035			\|a (OCoLC)37650219
035			\|a (DE-599)BVBBV011027783
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-20 \|a DE-91G \|a DE-824 \|a DE-473 \|a DE-19 \|a DE-703 \|a DE-634 \|a DE-83 \|a DE-11 \|a DE-355 \|a DE-898 \|a DE-188
050		0	\|a QA267.7
082	0		\|a 511.3
084			\|a SK 890 \|0 (DE-625)143267: \|2 rvk
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
250			\|a Reprint. with corr.
264		1	\|a Reading, Mass. [u.a.] \|b Addison-Wesley \|c 1995
300			\|a XV, 523 S. \|b graph. Darst.
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650		4	\|a Complexité de calcul (Informatique)
650		4	\|a Computational complexity
650	0	7	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|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 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 Algorithmus \|0 (DE-588)4001183-5 \|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
856	4	2	\|m HBZ Datenaustausch \|q application/pdf \|u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007383667&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA \|3 Inhaltsverzeichnis
999			\|a oai:aleph.bib-bvb.de:BVB01-007383667
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

Record in the Search Index

_version_	1804125517609172992
adam_text	Contents PART I: ALGORITHMS 1 1 Problems and Algorithms 3 1.1 Graph reachability 3 1.2 Maximum flow and matching 8 1.3 The traveling salesman problem 13 1.4 Notes, references, and problems 14 2 Turing machines 19 2.1 Turing machine basics 19 2.2 Turing machines as algorithms 24 2.3 Turing machines with multiple strings 26 2.4 Linear speedup 32 2.5 Space bounds 34 2.6 Random access machines 36 2.7 Nondeterministic machines 45 2.8 Notes, references, and problems 51 3 Computability 57 3.1 Universal Turing machines 57 3.2 The halting problem 58 3.3 More undecidability 60 3.4 Notes, references, and problems 66 xi xii Contents PART II: LOGIC 71 4 Boolean logic 73 4.1 Boolean Expressions 4.2 Satisfiability and validity 76 4.3 Boolean functions and circuits 79 4.4 Notes, references, and problems 84 5 First order logic 87 5.1 The syntax of first order logic 87 5.2 Models 90 5.3 Valid expressions 95 5.4 Axioms and proofs 100 5.5 The completeness theorem 105 5.6 Consequences of the completeness theorem 110 5.7 Second order logic 113 5.8 Notes, references, and problems 118 6 Undecidability in logic 123 6.1 Axioms for number theory 123 6.2 Complexity as a number theoretic concept 127 6.3 Undecidability and incompleteness 131 6.4 Notes, references, and problems 135 PART III: P AND NP 137 7 Relations between complexity classes 139 7.1 Complexity classes 139 7.2 The hierarchy theorem 143 7.3 The reachability method 146 7.4 Notes, references, and problems 154 8 Reductions and completeness 159 8.1 Reductions 159 8.2 Completeness 165 Contents xiii 8.3 Logical characterizations 172 8.4 Notes, references, and problems 177 9 NP complete problems 181 9.1 Problems in NP 181 9.2 Variants of satisfiability 183 9.3 Graph theoretic problems 188 9.4 Sets and numbers 199 9.5 Notes, references, and problems 207 10 coNP and function problems 219 10.1 NP and coNP 219 10.2 Primality 222 10.3 Function problems 227 10.4 Notes, references, and problems 235 11 Randomized computation 241 11.1 Randomized algorithms 241 11.2 Randomized complexity classes 253 11.3 Random sources 259 11.4 Circuit complexity 267 11.5 Notes, references, and problems 272 12 Cryptography 279 12.1 One way functions 279 12.2 Protocols 287 12.3 Notes, references, and problems 294 13 Approximability 299 13.1 Approximation algorithms 299 13.2 Approximation and complexity 309 13.3 Nonapproximability 319 13.4 Notes, references, and problems 323 xiv Contents 14 On P vs. NP 329 14.1 The map of NP 329 14.2 Isomorphism and density 332 14.3 Oracles 339 14.4 Monotone circuits 343 14.5 Notes, references, and problems 350 PART IV: INSIDE P 357 15 Parallel computation 359 15.1 Parallel algorithms 359 15.2 Parallel models of computation 369 15.3 The class NC 375 15.4 RNC algorithms 381 15.5 Notes, references, and problems 385 16 Logarithmic space 395 16.1 The L = NL problem 395 16.2 Alternation 399 16.3 Undirected reachability 401 16.4 Notes, references, and problems 405 PART V: BEYOND NP 409 17 The polynomial hierarchy 411 17.1 Optimization problems 411 17.2 The hierarchy 424 17.3 Notes, references, and problems 433 18 Computation that counts 439 18.1 The permanent 439 18.2 The class ©P 447 18.3 Notes, references, and problems 452 Contents xv 19 Polynomial space 455 19.1 Alternation and games 455 19.2 Games against nature and interactive protocols 469 19.3 More PSPACE complete problems 480 19.4 Notes, references, and problems 487 20 A glimpse beyond 491 20.1 Exponential time 491 20.2 Notes, references, and problems 499 Index 509 Author index 519
any_adam_object	1
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	BV011027783
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 890 ST 130 ST 134
classification_tum	DAT 517f
ctrlnum	(OCoLC)37650219 (DE-599)BVBBV011027783
dewey-full	511.3
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	511 - General principles of mathematics
dewey-raw	511.3
dewey-search	511.3
dewey-sort	3511.3
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
edition	Reprint. with corr.
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02758nam a2200661 c 4500</leader><controlfield tag="001">BV011027783</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20130725 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961029s1995 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)37650219</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011027783</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-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-898</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="0" ind2=" "><subfield code="a">511.3</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</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="250" ind1=" " ind2=" "><subfield code="a">Reprint. with corr.</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">1995</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=" " ind2="4"><subfield code="a">Complexité de calcul (Informatique)</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">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">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">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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</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="856" ind1="4" ind2="2"><subfield code="m">HBZ Datenaustausch</subfield><subfield code="q">application/pdf</subfield><subfield code="u">http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007383667&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007383667</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></record></collection>
id	DE-604.BV011027783
illustrated	Illustrated
indexdate	2024-07-09T18:02:49Z
institution	BVB
isbn	0201530821
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-007383667
oclc_num	37650219
open_access_boolean
owner	DE-20 DE-91G DE-BY-TUM DE-824 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-703 DE-634 DE-83 DE-11 DE-355 DE-BY-UBR DE-898 DE-BY-UBR DE-188
owner_facet	DE-20 DE-91G DE-BY-TUM DE-824 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-703 DE-634 DE-83 DE-11 DE-355 DE-BY-UBR DE-898 DE-BY-UBR DE-188
physical	XV, 523 S. graph. Darst.
publishDate	1995
publishDateSearch	1995
publishDateSort	1995
publisher	Addison-Wesley
record_format	marc
spelling	Papadimitriou, Christos H. 1949- Verfasser (DE-588)135731909 aut Computational complexity Christos H. Papadimitriou Reprint. with corr. Reading, Mass. [u.a.] Addison-Wesley 1995 XV, 523 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Complexité de calcul (Informatique) Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Boolesche Algebra (DE-588)4146280-4 gnd rswk-swf 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 Algorithmus (DE-588)4001183-5 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 s DE-604 Algorithmus (DE-588)4001183-5 s 1\p DE-604 Komplexität (DE-588)4135369-9 s 2\p DE-604 Turing-Maschine (DE-588)4203525-9 s 3\p DE-604 Kryptologie (DE-588)4033329-2 s 4\p DE-604 Boolesche Algebra (DE-588)4146280-4 s 5\p DE-604 HBZ Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007383667&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk
spellingShingle	Papadimitriou, Christos H. 1949- Computational complexity Complexité de calcul (Informatique) Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Boolesche Algebra (DE-588)4146280-4 gnd Turing-Maschine (DE-588)4203525-9 gnd Kryptologie (DE-588)4033329-2 gnd Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd
subject_GND	(DE-588)4120591-1 (DE-588)4146280-4 (DE-588)4203525-9 (DE-588)4033329-2 (DE-588)4135369-9 (DE-588)4001183-5
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	Complexité de calcul (Informatique) Computational complexity Komplexitätstheorie (DE-588)4120591-1 gnd Boolesche Algebra (DE-588)4146280-4 gnd Turing-Maschine (DE-588)4203525-9 gnd Kryptologie (DE-588)4033329-2 gnd Komplexität (DE-588)4135369-9 gnd Algorithmus (DE-588)4001183-5 gnd
topic_facet	Complexité de calcul (Informatique) Computational complexity Komplexitätstheorie Boolesche Algebra Turing-Maschine Kryptologie Komplexität Algorithmus
url	http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=007383667&sequence=000002&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA
work_keys_str_mv	AT papadimitriouchristosh computationalcomplexity

Holdings

There is no print copy available.

Interlibrary loan Place Request Caution: Not in THWS collection! Indexes

MARC

Record in the Search Index

There is no print copy available.

Similar Items