Algorithmic and computational complexity issues of MONET:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Abschlussarbeit Buch |
| Sprache: | English |
| Veröffentlicht: |
Göttingen
Cuvillier
2008
|
| Ausgabe: | 1. Aufl. |
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | XI, 141 S. 21 cm |
| ISBN: | 9783867278263 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV040344935 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 120801s2008 gw m||| 00||| eng d | ||
| 015 | |a 09,N07,1455 |2 dnb | ||
| 015 | |a 09,H05,0752 |2 dnb | ||
| 016 | 7 | |a 99226300X |2 DE-101 | |
| 020 | |a 9783867278263 |c kart. : EUR 23.00 |9 978-3-86727-826-3 | ||
| 024 | 3 | |a 9783867278263 | |
| 035 | |a (OCoLC)318642591 | ||
| 035 | |a (DE-599)DNB99226300X | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 044 | |a gw |c XA-DE-NI | ||
| 049 | |a DE-29T | ||
| 082 | 0 | |a 511.352 |2 22/ger | |
| 084 | |a 510 |2 sdnb | ||
| 100 | 1 | |a Hagen, Matthias |d 1979- |e Verfasser |0 (DE-588)137727577 |4 aut | |
| 245 | 1 | 0 | |a Algorithmic and computational complexity issues of MONET |c von Matthias Hagen |
| 250 | |a 1. Aufl. | ||
| 264 | 1 | |a Göttingen |b Cuvillier |c 2008 | |
| 300 | |a XI, 141 S. |c 21 cm | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 502 | |a Zugl.: Jena, Univ., Diss., 2008 | ||
| 650 | 0 | 7 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Äquivalenz |0 (DE-588)4141497-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Disjunktive Normalform |0 (DE-588)7654726-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Konjunktive Normalform |0 (DE-588)7654727-9 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Disjunktive Normalform |0 (DE-588)7654726-7 |D s |
| 689 | 0 | 1 | |a Konjunktive Normalform |0 (DE-588)7654727-9 |D s |
| 689 | 0 | 2 | |a Äquivalenz |0 (DE-588)4141497-4 |D s |
| 689 | 0 | 3 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | |5 DE-604 | |
| 856 | 4 | 2 | |m DNB Datenaustausch |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025199109&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-025199109 | ||
Datensatz im Suchindex
| _version_ | 1804149379968270336 |
|---|---|
| adam_text | IMAGE 1
CONTENTS
INTRODUCTION 1
1.1 WHAT MEANS AND TO WHAT END DO WE STUDY MONET? 1
1.2 LEGEND TO THIS THESIS 6
PRELIMINARIES 7
2.1 ALGORITHMS AND COMPUTATIONAL COMPLEXITY 7
2.1.1 TOOLS FOR ALGORITHM ANALYSIS 8
2.1.2 COMPLEXITY CLASSES 8
2.1.3 REDUCTIONS AND HARDNESS 9
2.2 BOOLEAN FORMULAS, MONOTONICITY, AND THE PROBLEM M O N ET . . .. 10
2.2.1 SYNTAX AND SEMANTICS OF BOOLEAN FORMULAS 10
2.2.2 MONOTONE FORMULAS AND EQUIVALENCE 11
2.2.3 NORMAL FORMS OF FORMULAS 12
2.2.4 THE PROBLEM M O N ET 14
2.2.5 STATE OF THE ART IN M O N ET COMPLEXITY 15
2.3 HYPERGRAPHS, TRANSVERSALS, AND THE PROBLEM T R A N S H YP 16 2.3.1
HYPERGRAPHS AND TRANSVERSALS 16
2.3.2 THE PROBLEM TRANSHYP 17
2.3.3 FURTHER HYPERGRAPH NOTATION 17
2.4 EQUIVALENCE OF M O N ET AND T R A N S H YP 18
2.5 BASIC COMPUTATIONAL TASKS 19
2.5.1 PREPROCESSING STEPS 19
2.5.2 BASIC CHECKS 21
APPLICATIONS 25
3.1 ARTIFICIAL INTELLIGENCE 25
3.2 COMBINATORIAL OPTIMIZATION 27
3.3 COMPUTATIONAL BIOLOGY 27
3.4 COMPUTATIONAL GEOMETRY 28
3.5 COMPUTATIONAL MEDICINE 29
3.6 CRYPTOGRAPHY 29
3.7 DATABASES 29
3.8 DATA MINING 31
3.9 DISTRIBUTED SYSTEMS 33
3.10 E-COMMERCE 33
3.11 GAME THEORY 34
BIBLIOGRAFISCHE INFORMATIONEN HTTP://D-NB.INFO/99226300X
DIGITALISIERT DURCH
IMAGE 2
CONTENTS
3.12 GRAPH THEORY 34
3.13 LATTICE THEORY 36
3.14 LOGIC 37
3.15 MACHINE LEARNING 39
3.16 MATHEMATICAL PROGRAMMING 40
3.17 MATROID THEORY 41
3.18 MOBILE COMMUNICATION SYSTEMS 41
3.19 RELIABILITY THEORY 42
3.20 SEMANTIC WEB 42
3.21 SOFTWARE ENGINEERING 42
3.22 TOPOLOGY 42
3.23 XML 43
4 EASY CLASSES 45
4.1 RESTRICTIONS ON THE SIZE OF THE DNF 46
4.1.1 THE DNF CONTAINS ONLY A CONSTANT NUMBER OF MONOMIALS . 46 4.1.2
THE DNF CONTAINS ONLY MONOMIALS OF CONSTANT SIZE . . .. 47
4.1.3 THE DNF CONTAINS ONLY VERY LARGE MONOMIALS 48
4.1.4 POLYNOMIAL TIME SIZE RESTRICTIONS 50
4.2 STRUCTURAL RESTRICTIONS ON THE DNF 50
4.2.1 THE DNF IS REGULAER 50
4.2.2 THE DNF IS ALIGNED 54
4.2.3 THE DNF IS 2-MONOTONIC 59
4.2.4 POLYNOMIAL TIME STRUCTURAL RESTRICTIONS 63
4.2.5 A STRUCTURAL RESTRICTION THAT DOES NOT HELP 68
4.3 CONCLUDING REMARKS 68
5 ALGORITHMS 69
5.1 BERGE-MULTIPLICATION AND ITS UENPROVEMENTS 70
5.1.1 BERGE-MULTIPLICATION 70
5.1.2 THE ALGORITHM OF DONG AND LI 71
5.1.3 THE ALGORITHM OF BAILEY, MANOUKIAN, AND RAMAMOHANARAO 71 5.1.4 THE
ALGORITHM OF KAWADIAS AND STAVROPOULOS 77
5.2 THE ALGORITHM OF HEBERT, BRETTO, AND CREMIUEUX 82
5.3 THE ALGORITHMS OF FREDMAN AND KHAEHIYAN 84
5.3.1 PRECONDITIONS 85
5.3.2 FK-ALGORITHM A 85
5.3.3 FK-ALGORITHM B 87
5.4 CONCLUDING REMARKS 89
6 ALGORITHM ENGINEERING 91
6.1 A FEW IMPLEMENTATION DETAILS 91
6.2 EXPERIMENTAL RESULTS 92
6.3 CONCLUSION 95
IMAGE 3
CONTENTS
7 FIXED-PARAMETER TRACTABILITY 97
7.1 NUMBER OF VARIABLES AS PARAMETER 97
7.2 NUMBER OF MONOMIALS AS PARAMETER 99
7.3 VARIABLE DEGREES AS PARAMETER 101
7.4 RESULTS BASED ON THE APRIORI TECHNIQUE 102
7.4.1 THE GENERALIZED APRIORI ALGORITHM 103
7.4.2 INTERSECTIONS OF MAXIMAL INDEPENDENT SETS 103
7.4.3 UNIONS OF MINIMAL TRANSVERSALS OR EDGES 106
7.4.4 INTERSECTIONS OF MAXIMAL FREQUENT SETS OR TRANSACTIONS . . . 106
7.5 CONCLUDING REMARKS 107
8 CONCLUSION 109
BIBLIOGRAPHY 111
|
| any_adam_object | 1 |
| author | Hagen, Matthias 1979- |
| author_GND | (DE-588)137727577 |
| author_facet | Hagen, Matthias 1979- |
| author_role | aut |
| author_sort | Hagen, Matthias 1979- |
| author_variant | m h mh |
| building | Verbundindex |
| bvnumber | BV040344935 |
| ctrlnum | (OCoLC)318642591 (DE-599)DNB99226300X |
| dewey-full | 511.352 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511.352 |
| dewey-search | 511.352 |
| dewey-sort | 3511.352 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| edition | 1. Aufl. |
| format | Thesis Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01910nam a2200493 c 4500</leader><controlfield tag="001">BV040344935</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">120801s2008 gw m||| 00||| eng d</controlfield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,N07,1455</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="015" ind1=" " ind2=" "><subfield code="a">09,H05,0752</subfield><subfield code="2">dnb</subfield></datafield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">99226300X</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783867278263</subfield><subfield code="c">kart. : EUR 23.00</subfield><subfield code="9">978-3-86727-826-3</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9783867278263</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)318642591</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DNB99226300X</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="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">XA-DE-NI</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.352</subfield><subfield code="2">22/ger</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">510</subfield><subfield code="2">sdnb</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hagen, Matthias</subfield><subfield code="d">1979-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)137727577</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithmic and computational complexity issues of MONET</subfield><subfield code="c">von Matthias Hagen</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1. Aufl.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Göttingen</subfield><subfield code="b">Cuvillier</subfield><subfield code="c">2008</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XI, 141 S.</subfield><subfield code="c">21 cm</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="502" ind1=" " ind2=" "><subfield code="a">Zugl.: Jena, Univ., Diss., 2008</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">Äquivalenz</subfield><subfield code="0">(DE-588)4141497-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Disjunktive Normalform</subfield><subfield code="0">(DE-588)7654726-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Konjunktive Normalform</subfield><subfield code="0">(DE-588)7654727-9</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">Disjunktive Normalform</subfield><subfield code="0">(DE-588)7654726-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Konjunktive Normalform</subfield><subfield code="0">(DE-588)7654727-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><subfield code="a">Äquivalenz</subfield><subfield code="0">(DE-588)4141497-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="3"><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=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">DNB 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=025199109&sequence=000001&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-025199109</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV040344935 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T00:22:06Z |
| institution | BVB |
| isbn | 9783867278263 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-025199109 |
| oclc_num | 318642591 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | XI, 141 S. 21 cm |
| publishDate | 2008 |
| publishDateSearch | 2008 |
| publishDateSort | 2008 |
| publisher | Cuvillier |
| record_format | marc |
| spelling | Hagen, Matthias 1979- Verfasser (DE-588)137727577 aut Algorithmic and computational complexity issues of MONET von Matthias Hagen 1. Aufl. Göttingen Cuvillier 2008 XI, 141 S. 21 cm txt rdacontent n rdamedia nc rdacarrier Zugl.: Jena, Univ., Diss., 2008 Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Äquivalenz (DE-588)4141497-4 gnd rswk-swf Disjunktive Normalform (DE-588)7654726-7 gnd rswk-swf Konjunktive Normalform (DE-588)7654727-9 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Disjunktive Normalform (DE-588)7654726-7 s Konjunktive Normalform (DE-588)7654727-9 s Äquivalenz (DE-588)4141497-4 s Berechnungskomplexität (DE-588)4134751-1 s DE-604 DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025199109&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hagen, Matthias 1979- Algorithmic and computational complexity issues of MONET Berechnungskomplexität (DE-588)4134751-1 gnd Äquivalenz (DE-588)4141497-4 gnd Disjunktive Normalform (DE-588)7654726-7 gnd Konjunktive Normalform (DE-588)7654727-9 gnd |
| subject_GND | (DE-588)4134751-1 (DE-588)4141497-4 (DE-588)7654726-7 (DE-588)7654727-9 (DE-588)4113937-9 |
| title | Algorithmic and computational complexity issues of MONET |
| title_auth | Algorithmic and computational complexity issues of MONET |
| title_exact_search | Algorithmic and computational complexity issues of MONET |
| title_full | Algorithmic and computational complexity issues of MONET von Matthias Hagen |
| title_fullStr | Algorithmic and computational complexity issues of MONET von Matthias Hagen |
| title_full_unstemmed | Algorithmic and computational complexity issues of MONET von Matthias Hagen |
| title_short | Algorithmic and computational complexity issues of MONET |
| title_sort | algorithmic and computational complexity issues of monet |
| topic | Berechnungskomplexität (DE-588)4134751-1 gnd Äquivalenz (DE-588)4141497-4 gnd Disjunktive Normalform (DE-588)7654726-7 gnd Konjunktive Normalform (DE-588)7654727-9 gnd |
| topic_facet | Berechnungskomplexität Äquivalenz Disjunktive Normalform Konjunktive Normalform Hochschulschrift |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=025199109&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hagenmatthias algorithmicandcomputationalcomplexityissuesofmonet |