Theory of semi-feasible algorithms:
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Berlin [u.a.]
Springer
2003
|
| Schriftenreihe: | Monographs in theoretical computer science
|
| Schlagworte: | |
| Online-Zugang: | Inhaltsverzeichnis |
| Beschreibung: | X, 148 S. graph. Darst. |
| ISBN: | 3540422005 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV014221128 | ||
| 003 | DE-604 | ||
| 005 | 20021218 | ||
| 007 | t | ||
| 008 | 020327s2003 d||| |||| 00||| eng d | ||
| 016 | 7 | |a 964775352 |2 DE-101 | |
| 020 | |a 3540422005 |9 3-540-42200-5 | ||
| 035 | |a (OCoLC)248645724 | ||
| 035 | |a (DE-599)BVBBV014221128 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-739 |a DE-20 |a DE-91G |a DE-634 | ||
| 050 | 0 | |a QA76.9.A43 | |
| 082 | 0 | |a 005.1 | |
| 082 | 0 | |a 511.8 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a 17.1 |2 ssgn | ||
| 084 | |a DAT 517f |2 stub | ||
| 100 | 1 | |a Hemaspaandra, Lane A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Theory of semi-feasible algorithms |c Lane A. Hemaspaandra ; Leen Torenvliet |
| 264 | 1 | |a Berlin [u.a.] |b Springer |c 2003 | |
| 300 | |a X, 148 S. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Monographs in theoretical computer science | |
| 650 | 4 | |a Berechnungskomplexität - Semi-feasible Algorithm | |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |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 Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Semi-feasible Algorithm |0 (DE-588)4716214-4 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 2 | 1 | |a Semi-feasible Algorithm |0 (DE-588)4716214-4 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Torenvliet, Leen |e Verfasser |4 aut | |
| 856 | 4 | 2 | |m HEBIS Datenaustausch Darmstadt |q application/pdf |u http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009751080&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-009751080 | ||
Datensatz im Suchindex
| _version_ | 1804129107477266432 |
|---|---|
| adam_text | LANE A. HEMASPAANDRA * LEEN TORENVLIET THEORY OF SEMI-FEASIBLE
ALGORITHMS WITH 6 FIGURES SPRINGER CONTENTS PREFACE V 1. INTRODUCTION TO
SEMI-FEASIBLE COMPUTATION 1 1.1 P-SELECTIVITY 1 1.1.1 BACKGROUND AND
DEFINITIONS 1 1.1.2 BASIC PROPERTIES 3 1.2 NONDETERMINISTIC SELECTIVITY
9 1.2.1 BACKGROUND AND DEFINITIONS 9 1.2.2 BASIC PROPERTIES 10 1.3
BIBLIOGRAPHIC NOTES 15 2. ADVICE 17 2.1 ADVICE STRINGS AND CIRCUITS 17
2.2 ADVICE FOR P-SELECTIVE SETS 20 2.2.1 UPPER BOUNDS ON THE AMOUNT OF
ADVICE FOR P-SELECTIVE SETS 21 2.2.2 ARE THERE P-SELECTIVE SETS OTHER
THAN STANDARD LEFT CUTS? 28 2.2.3 LOWER BOUNDS 31 2.3 ADVICE FOR
NONDETERMINISTICALLY SELECTIVE SETS 32 2.4 ARE THERE UNIQUE SOLUTIONS
FOR NP? 35 2.4.1 SMALL CIRCUITS AND THE POLYNOMIAL HIERARCHY 35 2.4.2 NP
LACKS UNIQUE SOLUTIONS UNLESS THE POLYNOMIAL HIERARCHY COLLAPSES 38 2.5
BIBLIOGRAPHIC NOTES 39 3. LOWNESS . . . 41 3.1 LOWNESS BASICS 41 3.1.1
BASIC LOWNESS THEORY 41 3.1.2 EXTENDED LOWNESS AND REFINED LOWNESS 43
3.2 LOWNESS OF P-SELECTIVE SETS 46 3.2.1 UPPER BOUNDS 47 3.2.2 LOWER
BOUNDS 48 3.3 LOWNESS OF NONDETERMINISTICALLY SELECTIVE SETS 49 X
CONTENTS 3.3.1 UPPER BOUNDS : 49 3.3.2 LOWER BOUNDS 58 3.4 BIBLIOGRAPHIC
NOTES 58 4. HARDNESS FOR COMPLEXITY CLASSES 61 4.1 CAN P-SELECTIVE SETS
BE HARD FOR COMPLEXITY CLASSES? 61 4.2 CAN P-SELECTIVE SETS BE
TRUTH-TABLE-HARD FOR UP, A, PSPACE, OR EXP? 62 4.3 CAN P-SELECTIVE SETS
BE TRUTH-TABLE-HARD OR TURING-HARD FOR NP? 67 4.4 CAN
NONDETERMINISTICALLY SELECTIVE SETS BE NP-HARD OR CONP-HARD? 73 4.5
BIBLIOGRAPHIC NOTES 75 5. CLOSURES 79 5.1 CONNECTIVES AND REDUCTIONS 80
5.2 BOOLEAN CLOSURES 81 5.3 REDUCTIONS UNDER WHICH P-SEL IS CLOSED
DOWNWARD 85 5.4 SELF-REDUCIBLE SETS AND SELECTIVITY 88 5.5 REDUCTION AND
EQUIVALENCE CLASSES 94 5.5.1 EQUALITIES 94 5.5.2 INEQUALITIES 95 5.6
BIBLIOGRAPHIC NOTES 102 6. GENERALIZATIONS AND RELATED NOTIONS 105 6.1
GENERALIZATIONS OF SELECTIVITY 105 6.1.1 WEAK SELECTIVITY 105 6.1.2
MULTISELECTIVITY: THE S(K) HIERARCHY 106 6.1.3 MEMBERSHIP COMPARABLE
SETS 107 6.1.4 PROBABILISTIC SELECTOR FUNCTIONS 109 6.2
P-SEMI-RANKABILITY: A PROVABLE REFINEMENT OF P-SELECTIVITY . 110 6.3
ASSOCIATIVE P-SELECTIVITY: A POTENTIAL REFINEMENT OF P-SELECTIVITY ILL
6.4 BIBLIOGRAPHIC NOTES 112 A. DEFINITIONS OF REDUCTIONS AND COMPLEXITY
CLASSES, AND NOTATION LIST 115 A.I REDUCTIONS 115 A.2 COMPLEXITY CLASSES
116 A.3 SOME OTHER NOTATION 123 REFERENCES 125 INDEX 133
|
| any_adam_object | 1 |
| author | Hemaspaandra, Lane A. Torenvliet, Leen |
| author_facet | Hemaspaandra, Lane A. Torenvliet, Leen |
| author_role | aut aut |
| author_sort | Hemaspaandra, Lane A. |
| author_variant | l a h la lah l t lt |
| building | Verbundindex |
| bvnumber | BV014221128 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76.9.A43 |
| callnumber-search | QA76.9.A43 |
| callnumber-sort | QA 276.9 A43 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 130 |
| classification_tum | DAT 517f |
| ctrlnum | (OCoLC)248645724 (DE-599)BVBBV014221128 |
| dewey-full | 005.1 511.8 |
| dewey-hundreds | 000 - Computer science, information, general works 500 - Natural sciences and mathematics |
| dewey-ones | 005 - Computer programming, programs, data, security 511 - General principles of mathematics |
| dewey-raw | 005.1 511.8 |
| dewey-search | 005.1 511.8 |
| dewey-sort | 15.1 |
| dewey-tens | 000 - Computer science, information, general works 510 - Mathematics |
| discipline | Informatik Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02084nam a2200541 c 4500</leader><controlfield tag="001">BV014221128</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20021218 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">020327s2003 d||| |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">964775352</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3540422005</subfield><subfield code="9">3-540-42200-5</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248645724</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV014221128</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-739</subfield><subfield code="a">DE-20</subfield><subfield code="a">DE-91G</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76.9.A43</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.1</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511.8</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">17.1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">DAT 517f</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Hemaspaandra, Lane A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Theory of semi-feasible algorithms</subfield><subfield code="c">Lane A. Hemaspaandra ; Leen Torenvliet</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">X, 148 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">Monographs in theoretical computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Berechnungskomplexität - Semi-feasible Algorithm</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">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">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">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Semi-feasible Algorithm</subfield><subfield code="0">(DE-588)4716214-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><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">Komplexitätstheorie</subfield><subfield code="0">(DE-588)4120591-1</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">Berechnungskomplexität</subfield><subfield code="0">(DE-588)4134751-1</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2="1"><subfield code="a">Semi-feasible Algorithm</subfield><subfield code="0">(DE-588)4716214-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Torenvliet, Leen</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="m">HEBIS Datenaustausch Darmstadt</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=009751080&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-009751080</subfield></datafield></record></collection> |
| id | DE-604.BV014221128 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T18:59:53Z |
| institution | BVB |
| isbn | 3540422005 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009751080 |
| oclc_num | 248645724 |
| open_access_boolean | |
| owner | DE-739 DE-20 DE-91G DE-BY-TUM DE-634 |
| owner_facet | DE-739 DE-20 DE-91G DE-BY-TUM DE-634 |
| physical | X, 148 S. graph. Darst. |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer |
| record_format | marc |
| series2 | Monographs in theoretical computer science |
| spelling | Hemaspaandra, Lane A. Verfasser aut Theory of semi-feasible algorithms Lane A. Hemaspaandra ; Leen Torenvliet Berlin [u.a.] Springer 2003 X, 148 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Monographs in theoretical computer science Berechnungskomplexität - Semi-feasible Algorithm Algorithmus (DE-588)4001183-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Computer (DE-588)4070083-5 gnd rswk-swf Semi-feasible Algorithm (DE-588)4716214-4 gnd rswk-swf Computer (DE-588)4070083-5 s Algorithmus (DE-588)4001183-5 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Berechnungskomplexität (DE-588)4134751-1 s Semi-feasible Algorithm (DE-588)4716214-4 s Torenvliet, Leen Verfasser aut HEBIS Datenaustausch Darmstadt application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009751080&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Hemaspaandra, Lane A. Torenvliet, Leen Theory of semi-feasible algorithms Berechnungskomplexität - Semi-feasible Algorithm Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Computer (DE-588)4070083-5 gnd Semi-feasible Algorithm (DE-588)4716214-4 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)4120591-1 (DE-588)4070083-5 (DE-588)4716214-4 |
| title | Theory of semi-feasible algorithms |
| title_auth | Theory of semi-feasible algorithms |
| title_exact_search | Theory of semi-feasible algorithms |
| title_full | Theory of semi-feasible algorithms Lane A. Hemaspaandra ; Leen Torenvliet |
| title_fullStr | Theory of semi-feasible algorithms Lane A. Hemaspaandra ; Leen Torenvliet |
| title_full_unstemmed | Theory of semi-feasible algorithms Lane A. Hemaspaandra ; Leen Torenvliet |
| title_short | Theory of semi-feasible algorithms |
| title_sort | theory of semi feasible algorithms |
| topic | Berechnungskomplexität - Semi-feasible Algorithm Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Computer (DE-588)4070083-5 gnd Semi-feasible Algorithm (DE-588)4716214-4 gnd |
| topic_facet | Berechnungskomplexität - Semi-feasible Algorithm Algorithmus Berechnungskomplexität Komplexitätstheorie Computer Semi-feasible Algorithm |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009751080&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT hemaspaandralanea theoryofsemifeasiblealgorithms AT torenvlietleen theoryofsemifeasiblealgorithms |