Verfügbarkeit: Elements of dynamic and 2-SAT programming: paths, trees, and cuts

Elements of dynamic and 2-SAT programming: paths, trees, and cuts:

Gespeichert in:

Bibliographische Detailangaben
Beteilige Person:	Bentert, Matthias (VerfasserIn)
Format:	Hochschulschrift/Dissertation Elektronisch E-Book
Sprache:	Englisch
Veröffentlicht:	Berlin Universitätsverlag der TU Berlin 2021
Schriftenreihe:	Foundations of computing volume 14
Schlagwörter:	Exakte Lösung Worst-Case-Laufzeit Erfüllbarkeitsproblem Dynamische Optimierung Hochschulschrift
Links:	https://directory.doabooks.org/handle/20.500.12854/81574 https://doi.org/10.14279/depositonce-11462
Umfang:	1 Online-Ressource (xiv, 199 Seiten) Illustrationen, Diagramme
ISBN:	9783798332102
DOI:	10.14279/depositonce-11462

Internformat

MARC


LEADER	00000nam a2200000 cb4500
001	BV047940857
003	DE-604
005	20220706
007	cr\|uuu---uuuuu
008	220413s2021 gw a\|\|\| om\|\|\| 00\|\|\| eng d
015			\|a 21,O12 \|2 dnb
016	7		\|a 1246363658 \|2 DE-101
020			\|a 9783798332102 \|c Online \|9 978-3-7983-3210-2
024	7		\|a 10.14279/depositonce-11462 \|2 doi
035			\|a (OCoLC)1312706981
035			\|a (DE-599)DNB1246363658
040			\|a DE-604 \|b ger \|e rda
041	0		\|a eng
044			\|a gw \|c XA-DE-BE
049			\|a DE-12 \|a DE-210 \|a DE-521 \|a DE-1102 \|a DE-1046 \|a DE-1028 \|a DE-1050 \|a DE-573 \|a DE-M347 \|a DE-92 \|a DE-1051 \|a DE-898 \|a DE-859 \|a DE-860 \|a DE-1049 \|a DE-861 \|a DE-863 \|a DE-862 \|a DE-Re13 \|a DE-Y3 \|a DE-255 \|a DE-Y7 \|a DE-Y2 \|a DE-70 \|a DE-2174 \|a DE-127 \|a DE-22 \|a DE-155 \|a DE-83 \|a DE-91 \|a DE-384 \|a DE-473 \|a DE-19 \|a DE-355 \|a DE-703 \|a DE-20 \|a DE-706 \|a DE-824 \|a DE-29 \|a DE-739
084			\|a ST 620 \|0 (DE-625)143684: \|2 rvk
100	1		\|a Bentert, Matthias \|e Verfasser \|0 (DE-588)1255323760 \|4 aut
245	1	0	\|a Elements of dynamic and 2-SAT programming: paths, trees, and cuts \|c Matthias Bentert
264		1	\|a Berlin \|b Universitätsverlag der TU Berlin \|c 2021
300			\|a 1 Online-Ressource (xiv, 199 Seiten) \|b Illustrationen, Diagramme
336			\|b txt \|2 rdacontent
337			\|b c \|2 rdamedia
338			\|b cr \|2 rdacarrier
490	1		\|a Foundations of computing \|v volume 14
502			\|b Dissertation \|c Technische Universität Berlin \|d 2020
650	0	7	\|a Exakte Lösung \|0 (DE-588)4348289-2 \|2 gnd \|9 rswk-swf
650	0	7	\|a Worst-Case-Laufzeit \|0 (DE-588)4732657-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Erfüllbarkeitsproblem \|0 (DE-588)4323820-8 \|2 gnd \|9 rswk-swf
650	0	7	\|a Dynamische Optimierung \|0 (DE-588)4125677-3 \|2 gnd \|9 rswk-swf
655		7	\|0 (DE-588)4113937-9 \|a Hochschulschrift \|2 gnd-content
689	0	0	\|a Erfüllbarkeitsproblem \|0 (DE-588)4323820-8 \|D s
689	0	1	\|a Exakte Lösung \|0 (DE-588)4348289-2 \|D s
689	0	2	\|a Worst-Case-Laufzeit \|0 (DE-588)4732657-8 \|D s
689	0	3	\|a Dynamische Optimierung \|0 (DE-588)4125677-3 \|D s
689	0		\|5 DE-604
776	0	8	\|i Erscheint auch als \|n Druck-Ausgabe \|z 978-3-7983-3209-6
830		0	\|a Foundations of computing \|v volume 14 \|w (DE-604)BV044943050 \|9 14
856	4	0	\|u https://directory.doabooks.org/handle/20.500.12854/81574 \|x Verlag \|z kostenfrei \|3 Volltext
856	4	0	\|u https://doi.org/10.14279/depositonce-11462 \|x Resolving-System \|z kostenfrei \|3 Volltext
912			\|a ZDB-94-OAB
943	1		\|a oai:aleph.bib-bvb.de:BVB01-033322339

Datensatz im Suchindex

DE-BY-TUM_katkey	2662171
_version_	1822086409103605760
adam_text
any_adam_object
author	Bentert, Matthias
author_GND	(DE-588)1255323760
author_facet	Bentert, Matthias
author_role	aut
author_sort	Bentert, Matthias
author_variant	m b mb
building	Verbundindex
bvnumber	BV047940857
classification_rvk	ST 620
collection	ZDB-94-OAB
ctrlnum	(OCoLC)1312706981 (DE-599)DNB1246363658
discipline	Informatik
doi_str_mv	10.14279/depositonce-11462
format	Thesis Electronic eBook
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 cb4500</leader><controlfield tag="001">BV047940857</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20220706</controlfield><controlfield tag="007">cr\|uuu---uuuuu</controlfield><controlfield tag="008">220413s2021 gw a\|\|\| om\|\|\| 00\|\|\| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">21,O12</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">1246363658</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783798332102</subfield><subfield code="c">Online</subfield><subfield code="9">978-3-7983-3210-2</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.14279/depositonce-11462</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1312706981</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB1246363658</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-BE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-210</subfield><subfield code="a">DE-521</subfield><subfield code="a">DE-1102</subfield><subfield code="a">DE-1046</subfield><subfield code="a">DE-1028</subfield><subfield code="a">DE-1050</subfield><subfield code="a">DE-573</subfield><subfield code="a">DE-M347</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-1051</subfield><subfield code="a">DE-898</subfield><subfield code="a">DE-859</subfield><subfield code="a">DE-860</subfield><subfield code="a">DE-1049</subfield><subfield code="a">DE-861</subfield><subfield code="a">DE-863</subfield><subfield code="a">DE-862</subfield><subfield code="a">DE-Re13</subfield><subfield code="a">DE-Y3</subfield><subfield code="a">DE-255</subfield><subfield code="a">DE-Y7</subfield><subfield code="a">DE-Y2</subfield><subfield code="a">DE-70</subfield><subfield code="a">DE-2174</subfield><subfield code="a">DE-127</subfield><subfield code="a">DE-22</subfield><subfield code="a">DE-155</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-384</subfield><subfield code="a">DE-473</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-355</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-29</subfield><subfield code="a">DE-739</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 620</subfield><subfield code="0">(DE-625)143684:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bentert, Matthias</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)1255323760</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Elements of dynamic and 2-SAT programming: paths, trees, and cuts</subfield><subfield code="c">Matthias Bentert</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin</subfield><subfield code="b">Universitätsverlag der TU Berlin</subfield><subfield code="c">2021</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiv, 199 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">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Foundations of computing</subfield><subfield code="v">volume 14</subfield></datafield><datafield tag="502" ind1=" " ind2=" "><subfield code="b">Dissertation</subfield><subfield code="c">Technische Universität Berlin</subfield><subfield code="d">2020</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Exakte Lösung</subfield><subfield code="0">(DE-588)4348289-2</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Worst-Case-Laufzeit</subfield><subfield code="0">(DE-588)4732657-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dynamische Optimierung</subfield><subfield code="0">(DE-588)4125677-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Erfüllbarkeitsproblem</subfield><subfield code="0">(DE-588)4323820-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Exakte Lösung</subfield><subfield code="0">(DE-588)4348289-2</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Worst-Case-Laufzeit</subfield><subfield code="0">(DE-588)4732657-8</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><subfield code="a">Dynamische Optimierung</subfield><subfield code="0">(DE-588)4125677-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">978-3-7983-3209-6</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Foundations of computing</subfield><subfield code="v">volume 14</subfield><subfield code="w">(DE-604)BV044943050</subfield><subfield code="9">14</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://directory.doabooks.org/handle/20.500.12854/81574</subfield><subfield code="x">Verlag</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.14279/depositonce-11462</subfield><subfield code="x">Resolving-System</subfield><subfield code="z">kostenfrei</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-94-OAB</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-033322339</subfield></datafield></record></collection>
genre	(DE-588)4113937-9 Hochschulschrift gnd-content
genre_facet	Hochschulschrift
id	DE-604.BV047940857
illustrated	Illustrated
indexdate	2025-01-23T23:02:31Z
institution	BVB
isbn	9783798332102
language	English
oai_aleph_id	oai:aleph.bib-bvb.de:BVB01-033322339
oclc_num	1312706981
open_access_boolean	1
owner	DE-12 DE-210 DE-521 DE-1102 DE-1046 DE-1028 DE-1050 DE-573 DE-M347 DE-92 DE-1051 DE-898 DE-BY-UBR DE-859 DE-860 DE-1049 DE-861 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-Re13 DE-BY-UBR DE-Y3 DE-255 DE-Y7 DE-Y2 DE-70 DE-2174 DE-127 DE-22 DE-BY-UBG DE-155 DE-BY-UBR DE-83 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-20 DE-706 DE-824 DE-29 DE-739
owner_facet	DE-12 DE-210 DE-521 DE-1102 DE-1046 DE-1028 DE-1050 DE-573 DE-M347 DE-92 DE-1051 DE-898 DE-BY-UBR DE-859 DE-860 DE-1049 DE-861 DE-863 DE-BY-FWS DE-862 DE-BY-FWS DE-Re13 DE-BY-UBR DE-Y3 DE-255 DE-Y7 DE-Y2 DE-70 DE-2174 DE-127 DE-22 DE-BY-UBG DE-155 DE-BY-UBR DE-83 DE-91 DE-BY-TUM DE-384 DE-473 DE-BY-UBG DE-19 DE-BY-UBM DE-355 DE-BY-UBR DE-703 DE-20 DE-706 DE-824 DE-29 DE-739
physical	1 Online-Ressource (xiv, 199 Seiten) Illustrationen, Diagramme
psigel	ZDB-94-OAB
publishDate	2021
publishDateSearch	2021
publishDateSort	2021
publisher	Universitätsverlag der TU Berlin
record_format	marc
series	Foundations of computing
series2	Foundations of computing
spellingShingle	Bentert, Matthias Elements of dynamic and 2-SAT programming: paths, trees, and cuts Foundations of computing Exakte Lösung (DE-588)4348289-2 gnd Worst-Case-Laufzeit (DE-588)4732657-8 gnd Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Dynamische Optimierung (DE-588)4125677-3 gnd
subject_GND	(DE-588)4348289-2 (DE-588)4732657-8 (DE-588)4323820-8 (DE-588)4125677-3 (DE-588)4113937-9
title	Elements of dynamic and 2-SAT programming: paths, trees, and cuts
title_auth	Elements of dynamic and 2-SAT programming: paths, trees, and cuts
title_exact_search	Elements of dynamic and 2-SAT programming: paths, trees, and cuts
title_full	Elements of dynamic and 2-SAT programming: paths, trees, and cuts Matthias Bentert
title_fullStr	Elements of dynamic and 2-SAT programming: paths, trees, and cuts Matthias Bentert
title_full_unstemmed	Elements of dynamic and 2-SAT programming: paths, trees, and cuts Matthias Bentert
title_short	Elements of dynamic and 2-SAT programming: paths, trees, and cuts
title_sort	elements of dynamic and 2 sat programming paths trees and cuts
topic	Exakte Lösung (DE-588)4348289-2 gnd Worst-Case-Laufzeit (DE-588)4732657-8 gnd Erfüllbarkeitsproblem (DE-588)4323820-8 gnd Dynamische Optimierung (DE-588)4125677-3 gnd
topic_facet	Exakte Lösung Worst-Case-Laufzeit Erfüllbarkeitsproblem Dynamische Optimierung Hochschulschrift
url	https://directory.doabooks.org/handle/20.500.12854/81574 https://doi.org/10.14279/depositonce-11462
volume_link	(DE-604)BV044943050
work_keys_str_mv	AT bentertmatthias elementsofdynamicand2satprogrammingpathstreesandcuts

Verfügbarkeit

Bestellen (Login erforderlich)

Online lesen (frei zugänglich)
Paper/Kapitel scannen lassen