Verfügbarkeit: Computers and intractability

Computers and intractability: a guide to the theory of NP-completeness

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Garey, Michael Randolph 1945- (VerfasserIn), Johnson, David Stifler 1945-2016 (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	New York W. H. Freeman and Company 2003
Ausgabe:	Twenty-fourth printing
Schlagworte:	Algorithmentheorie Programmierung NP-vollständiges Problem Komplexität Grundlage Komplexitätstheorie Algorithmus Datenverarbeitung Berechnungskomplexität Mathematik
Beschreibung:	X, 338 Seiten Illustrationen, Diagramme
ISBN:	0716710455 0716710447

Internformat

MARC


LEADER	00000nam a2200000 c 4500
001	BV014775050
003	DE-604
005	20211217
007	t
008	021007s2003 a\|\|\| \|\|\|\| 00\|\|\| eng d
020			\|a 0716710455 \|9 0-7167-1045-5
020			\|a 0716710447 \|9 0-7167-1044-7
035			\|a (OCoLC)249036521
035			\|a (DE-599)BVBBV014775050
040			\|a DE-604 \|b ger \|e rakwb
041	0		\|a eng
049			\|a DE-703 \|a DE-83
050		0	\|a QA76.6
082	0		\|a 519.4
084			\|a ST 130 \|0 (DE-625)143588: \|2 rvk
100	1		\|a Garey, Michael Randolph \|d 1945- \|e Verfasser \|0 (DE-588)1180048075 \|4 aut
245	1	0	\|a Computers and intractability \|b a guide to the theory of NP-completeness \|c Michael R. Garey, David S. Johnson Bell Laboratories Murray Hill, New Jersey
250			\|a Twenty-fourth printing
264		1	\|a New York \|b W. H. Freeman and Company \|c 2003
300			\|a X, 338 Seiten \|b Illustrationen, Diagramme
336			\|b txt \|2 rdacontent
337			\|b n \|2 rdamedia
338			\|b nc \|2 rdacarrier
650	0	7	\|a Algorithmentheorie \|0 (DE-588)4200409-3 \|2 gnd \|9 rswk-swf
650	0	7	\|a Programmierung \|0 (DE-588)4076370-5 \|2 gnd \|9 rswk-swf
650	0	7	\|a NP-vollständiges Problem \|0 (DE-588)4138229-8 \|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 Grundlage \|0 (DE-588)4158388-7 \|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 Datenverarbeitung \|0 (DE-588)4011152-0 \|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 Mathematik \|0 (DE-588)4037944-9 \|2 gnd \|9 rswk-swf
689	0	0	\|a Berechnungskomplexität \|0 (DE-588)4134751-1 \|D s
689	0	1	\|a Komplexitätstheorie \|0 (DE-588)4120591-1 \|D s
689	0	2	\|a Algorithmentheorie \|0 (DE-588)4200409-3 \|D s
689	0		\|5 DE-604
689	1	0	\|a NP-vollständiges Problem \|0 (DE-588)4138229-8 \|D s
689	1		\|5 DE-604
689	2	0	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|D s
689	2	1	\|a Mathematik \|0 (DE-588)4037944-9 \|D s
689	2	2	\|a Grundlage \|0 (DE-588)4158388-7 \|D s
689	2		\|8 1\p \|5 DE-604
689	3	0	\|a Datenverarbeitung \|0 (DE-588)4011152-0 \|D s
689	3		\|5 DE-604
689	4	0	\|a Komplexität \|0 (DE-588)4135369-9 \|D s
689	4		\|8 2\p \|5 DE-604
689	5	0	\|a Algorithmus \|0 (DE-588)4001183-5 \|D s
689	5		\|8 3\p \|5 DE-604
689	6	0	\|a Programmierung \|0 (DE-588)4076370-5 \|D s
689	6		\|8 4\p \|5 DE-604
700	1		\|a Johnson, David Stifler \|d 1945-2016 \|e Verfasser \|0 (DE-588)118004858X \|4 aut
999			\|a oai:aleph.bib-bvb.de:BVB01-010004321
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

Datensatz im Suchindex

_version_	1804129559073783808
any_adam_object
author	Garey, Michael Randolph 1945- Johnson, David Stifler 1945-2016
author_GND	(DE-588)1180048075 (DE-588)118004858X
author_facet	Garey, Michael Randolph 1945- Johnson, David Stifler 1945-2016
author_role	aut aut
author_sort	Garey, Michael Randolph 1945-
author_variant	m r g mr mrg d s j ds dsj
building	Verbundindex
bvnumber	BV014775050
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
ctrlnum	(OCoLC)249036521 (DE-599)BVBBV014775050
dewey-full	519.4
dewey-hundreds	500 - Natural sciences and mathematics
dewey-ones	519 - Probabilities and applied mathematics
dewey-raw	519.4
dewey-search	519.4
dewey-sort	3519.4
dewey-tens	510 - Mathematics
discipline	Informatik Mathematik
edition	Twenty-fourth printing
format	Book
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02927nam a2200709 c 4500</leader><controlfield tag="001">BV014775050</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20211217 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">021007s2003 a\|\|\| \|\|\|\| 00\|\|\| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0716710455</subfield><subfield code="9">0-7167-1045-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0716710447</subfield><subfield code="9">0-7167-1044-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)249036521</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014775050</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="050" ind1=" " ind2="0"><subfield code="a">QA76.6</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">519.4</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="100" ind1="1" ind2=" "><subfield code="a">Garey, Michael Randolph</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1180048075</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computers and intractability</subfield><subfield code="b">a guide to the theory of NP-completeness</subfield><subfield code="c">Michael R. Garey, David S. Johnson Bell Laboratories Murray Hill, New Jersey</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">Twenty-fourth printing</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">W. H. Freeman and Company</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 338 Seiten</subfield><subfield code="b">Illustrationen, Diagramme</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">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</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">Grundlage</subfield><subfield code="0">(DE-588)4158388-7</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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Algorithmentheorie</subfield><subfield code="0">(DE-588)4200409-3</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">NP-vollständiges Problem</subfield><subfield code="0">(DE-588)4138229-8</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">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Mathematik</subfield><subfield code="0">(DE-588)4037944-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="2"><subfield code="a">Grundlage</subfield><subfield code="0">(DE-588)4158388-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Datenverarbeitung</subfield><subfield code="0">(DE-588)4011152-0</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">Komplexität</subfield><subfield code="0">(DE-588)4135369-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" 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="5" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="6" ind2="0"><subfield code="a">Programmierung</subfield><subfield code="0">(DE-588)4076370-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="6" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Johnson, David Stifler</subfield><subfield code="d">1945-2016</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)118004858X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-010004321</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></record></collection>
id	DE-604.BV014775050
illustrated	Illustrated
indexdate	2024-07-09T19:07:03Z
institution	BVB
isbn	0716710455 0716710447
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-010004321
oclc_num	249036521
open_access_boolean
owner	DE-703 DE-83
owner_facet	DE-703 DE-83
physical	X, 338 Seiten Illustrationen, Diagramme
publishDate	2003
publishDateSearch	2003
publishDateSort	2003
publisher	W. H. Freeman and Company
record_format	marc
spelling	Garey, Michael Randolph 1945- Verfasser (DE-588)1180048075 aut Computers and intractability a guide to the theory of NP-completeness Michael R. Garey, David S. Johnson Bell Laboratories Murray Hill, New Jersey Twenty-fourth printing New York W. H. Freeman and Company 2003 X, 338 Seiten Illustrationen, Diagramme txt rdacontent n rdamedia nc rdacarrier Algorithmentheorie (DE-588)4200409-3 gnd rswk-swf Programmierung (DE-588)4076370-5 gnd rswk-swf NP-vollständiges Problem (DE-588)4138229-8 gnd rswk-swf Komplexität (DE-588)4135369-9 gnd rswk-swf Grundlage (DE-588)4158388-7 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Datenverarbeitung (DE-588)4011152-0 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Mathematik (DE-588)4037944-9 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s Komplexitätstheorie (DE-588)4120591-1 s Algorithmentheorie (DE-588)4200409-3 s DE-604 NP-vollständiges Problem (DE-588)4138229-8 s Datenverarbeitung (DE-588)4011152-0 s Mathematik (DE-588)4037944-9 s Grundlage (DE-588)4158388-7 s 1\p DE-604 Komplexität (DE-588)4135369-9 s 2\p DE-604 Algorithmus (DE-588)4001183-5 s 3\p DE-604 Programmierung (DE-588)4076370-5 s 4\p DE-604 Johnson, David Stifler 1945-2016 Verfasser (DE-588)118004858X aut 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
spellingShingle	Garey, Michael Randolph 1945- Johnson, David Stifler 1945-2016 Computers and intractability a guide to the theory of NP-completeness Algorithmentheorie (DE-588)4200409-3 gnd Programmierung (DE-588)4076370-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Komplexität (DE-588)4135369-9 gnd Grundlage (DE-588)4158388-7 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Mathematik (DE-588)4037944-9 gnd
subject_GND	(DE-588)4200409-3 (DE-588)4076370-5 (DE-588)4138229-8 (DE-588)4135369-9 (DE-588)4158388-7 (DE-588)4120591-1 (DE-588)4001183-5 (DE-588)4011152-0 (DE-588)4134751-1 (DE-588)4037944-9
title	Computers and intractability a guide to the theory of NP-completeness
title_auth	Computers and intractability a guide to the theory of NP-completeness
title_exact_search	Computers and intractability a guide to the theory of NP-completeness
title_full	Computers and intractability a guide to the theory of NP-completeness Michael R. Garey, David S. Johnson Bell Laboratories Murray Hill, New Jersey
title_fullStr	Computers and intractability a guide to the theory of NP-completeness Michael R. Garey, David S. Johnson Bell Laboratories Murray Hill, New Jersey
title_full_unstemmed	Computers and intractability a guide to the theory of NP-completeness Michael R. Garey, David S. Johnson Bell Laboratories Murray Hill, New Jersey
title_short	Computers and intractability
title_sort	computers and intractability a guide to the theory of np completeness
title_sub	a guide to the theory of NP-completeness
topic	Algorithmentheorie (DE-588)4200409-3 gnd Programmierung (DE-588)4076370-5 gnd NP-vollständiges Problem (DE-588)4138229-8 gnd Komplexität (DE-588)4135369-9 gnd Grundlage (DE-588)4158388-7 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Algorithmus (DE-588)4001183-5 gnd Datenverarbeitung (DE-588)4011152-0 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Mathematik (DE-588)4037944-9 gnd
topic_facet	Algorithmentheorie Programmierung NP-vollständiges Problem Komplexität Grundlage Komplexitätstheorie Algorithmus Datenverarbeitung Berechnungskomplexität Mathematik
work_keys_str_mv	AT gareymichaelrandolph computersandintractabilityaguidetothetheoryofnpcompleteness AT johnsondavidstifler computersandintractabilityaguidetothetheoryofnpcompleteness

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