Theory of Semi-Feasible Algorithms:
This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
2003
|
| Edition: | 1st ed. 2003 |
| Series: | Monographs in Theoretical Computer Science. An EATCS Series
|
| Subjects: | |
| Online Access: | UBY01 Volltext |
| Summary: | This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference |
| Physical Description: | 1 Online-Ressource (X, 150 p) |
| ISBN: | 9783662050804 |
| DOI: | 10.1007/978-3-662-05080-4 |
Staff View
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV047064790 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 201216s2003 |||| o||u| ||||||eng d | ||
| 020 | |a 9783662050804 |9 978-3-662-05080-4 | ||
| 024 | 7 | |a 10.1007/978-3-662-05080-4 |2 doi | |
| 035 | |a (ZDB-2-SCS)978-3-662-05080-4 | ||
| 035 | |a (OCoLC)1227482773 | ||
| 035 | |a (DE-599)BVBBV047064790 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-706 | ||
| 082 | 0 | |a 005.11 |2 23 | |
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 100 | 1 | |a Hemaspaandra, Lane A. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Theory of Semi-Feasible Algorithms |c by Lane A. Hemaspaandra, Leen Torenvliet |
| 250 | |a 1st ed. 2003 | ||
| 264 | 1 | |a Berlin, Heidelberg |b Springer Berlin Heidelberg |c 2003 | |
| 300 | |a 1 Online-Ressource (X, 150 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Monographs in Theoretical Computer Science. An EATCS Series | |
| 520 | |a This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference | ||
| 650 | 4 | |a Programming Techniques | |
| 650 | 4 | |a Algorithm Analysis and Problem Complexity | |
| 650 | 4 | |a Computation by Abstract Devices | |
| 650 | 4 | |a Discrete Mathematics in Computer Science | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Combinatorics | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computers | |
| 650 | 4 | |a Computer science—Mathematics | |
| 650 | 4 | |a Combinatorics | |
| 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 Semi-feasible Algorithm |0 (DE-588)4716214-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Computer |0 (DE-588)4070083-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungskomplexität |0 (DE-588)4134751-1 |D s |
| 689 | 0 | 1 | |a Semi-feasible Algorithm |0 (DE-588)4716214-4 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Computer |0 (DE-588)4070083-5 |D s |
| 689 | 1 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 689 | 2 | 0 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |D s |
| 689 | 2 | |5 DE-604 | |
| 700 | 1 | |a Torenvliet, Leen |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783642075810 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783540422006 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9783662050811 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-3-662-05080-4 |x Verlag |z URL des Eerstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SCS | ||
| 940 | 1 | |q ZDB-2-SCS_2000/2004 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032471901 | ||
| 966 | e | |u https://doi.org/10.1007/978-3-662-05080-4 |l UBY01 |p ZDB-2-SCS |q ZDB-2-SCS_2000/2004 |x Verlag |3 Volltext | |
Record in the Search Index
| _version_ | 1804182063265349632 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| 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 | BV047064790 |
| classification_rvk | ST 130 |
| collection | ZDB-2-SCS |
| ctrlnum | (ZDB-2-SCS)978-3-662-05080-4 (OCoLC)1227482773 (DE-599)BVBBV047064790 |
| dewey-full | 005.11 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 005 - Computer programming, programs, data, security |
| dewey-raw | 005.11 |
| dewey-search | 005.11 |
| dewey-sort | 15.11 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| discipline_str_mv | Informatik |
| doi_str_mv | 10.1007/978-3-662-05080-4 |
| edition | 1st ed. 2003 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03537nmm a2200721zc 4500</leader><controlfield tag="001">BV047064790</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">201216s2003 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783662050804</subfield><subfield code="9">978-3-662-05080-4</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-3-662-05080-4</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SCS)978-3-662-05080-4</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1227482773</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV047064790</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-706</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.11</subfield><subfield code="2">23</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">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">by Lane A. Hemaspaandra, Leen Torenvliet</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 2003</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Berlin, Heidelberg</subfield><subfield code="b">Springer Berlin Heidelberg</subfield><subfield code="c">2003</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 150 p)</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="0" ind2=" "><subfield code="a">Monographs in Theoretical Computer Science. An EATCS Series</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming Techniques</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithm Analysis and Problem Complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computation by Abstract Devices</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Discrete Mathematics in Computer Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computers</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science—Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorics</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">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="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="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">Semi-feasible Algorithm</subfield><subfield code="0">(DE-588)4716214-4</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">Computer</subfield><subfield code="0">(DE-588)4070083-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" 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="2" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Torenvliet, Leen</subfield><subfield code="4">aut</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">9783642075810</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">9783540422006</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">9783662050811</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-3-662-05080-4</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Eerstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SCS</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SCS_2000/2004</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032471901</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-3-662-05080-4</subfield><subfield code="l">UBY01</subfield><subfield code="p">ZDB-2-SCS</subfield><subfield code="q">ZDB-2-SCS_2000/2004</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV047064790 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T16:12:23Z |
| indexdate | 2024-07-10T09:01:35Z |
| institution | BVB |
| isbn | 9783662050804 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032471901 |
| oclc_num | 1227482773 |
| open_access_boolean | |
| owner | DE-706 |
| owner_facet | DE-706 |
| physical | 1 Online-Ressource (X, 150 p) |
| psigel | ZDB-2-SCS ZDB-2-SCS_2000/2004 ZDB-2-SCS ZDB-2-SCS_2000/2004 |
| publishDate | 2003 |
| publishDateSearch | 2003 |
| publishDateSort | 2003 |
| publisher | Springer Berlin Heidelberg |
| record_format | marc |
| series2 | Monographs in Theoretical Computer Science. An EATCS Series |
| spelling | Hemaspaandra, Lane A. Verfasser aut Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra, Leen Torenvliet 1st ed. 2003 Berlin, Heidelberg Springer Berlin Heidelberg 2003 1 Online-Ressource (X, 150 p) txt rdacontent c rdamedia cr rdacarrier Monographs in Theoretical Computer Science. An EATCS Series This book presents a consolidated survey of the vibrant field of research known as the theory of semi-feasible algorithms. This research stream perfectly showcases the richness of, and contrasts between, the central notions of complexity: running time, nonuniform complexity, lowness, and NP-hardness. Research into semi-feasible computation has already developed a rich set of tools, yet is young enough to have an abundance of fresh, open issues. Being essentially self-contained, the book requires neither great mathematical maturity nor an extensive background in computational complexity theory or in computer science in general. Newcomers are introduced to the field systematically and guided to the frontiers of current research. Researchers already active in the field will appreciate the book as a valuable source of reference Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Discrete Mathematics in Computer Science Algorithms Combinatorics Computer programming Computers Computer science—Mathematics 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 Semi-feasible Algorithm (DE-588)4716214-4 gnd rswk-swf Computer (DE-588)4070083-5 gnd rswk-swf Berechnungskomplexität (DE-588)4134751-1 s Semi-feasible Algorithm (DE-588)4716214-4 s DE-604 Computer (DE-588)4070083-5 s Algorithmus (DE-588)4001183-5 s Komplexitätstheorie (DE-588)4120591-1 s Torenvliet, Leen aut Erscheint auch als Druck-Ausgabe 9783642075810 Erscheint auch als Druck-Ausgabe 9783540422006 Erscheint auch als Druck-Ausgabe 9783662050811 https://doi.org/10.1007/978-3-662-05080-4 Verlag URL des Eerstveröffentlichers Volltext |
| spellingShingle | Hemaspaandra, Lane A. Torenvliet, Leen Theory of Semi-Feasible Algorithms Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Discrete Mathematics in Computer Science Algorithms Combinatorics Computer programming Computers Computer science—Mathematics Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Semi-feasible Algorithm (DE-588)4716214-4 gnd Computer (DE-588)4070083-5 gnd |
| subject_GND | (DE-588)4001183-5 (DE-588)4134751-1 (DE-588)4120591-1 (DE-588)4716214-4 (DE-588)4070083-5 |
| title | Theory of Semi-Feasible Algorithms |
| title_auth | Theory of Semi-Feasible Algorithms |
| title_exact_search | Theory of Semi-Feasible Algorithms |
| title_exact_search_txtP | Theory of Semi-Feasible Algorithms |
| title_full | Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra, Leen Torenvliet |
| title_fullStr | Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra, Leen Torenvliet |
| title_full_unstemmed | Theory of Semi-Feasible Algorithms by Lane A. Hemaspaandra, Leen Torenvliet |
| title_short | Theory of Semi-Feasible Algorithms |
| title_sort | theory of semi feasible algorithms |
| topic | Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Discrete Mathematics in Computer Science Algorithms Combinatorics Computer programming Computers Computer science—Mathematics Algorithmus (DE-588)4001183-5 gnd Berechnungskomplexität (DE-588)4134751-1 gnd Komplexitätstheorie (DE-588)4120591-1 gnd Semi-feasible Algorithm (DE-588)4716214-4 gnd Computer (DE-588)4070083-5 gnd |
| topic_facet | Programming Techniques Algorithm Analysis and Problem Complexity Computation by Abstract Devices Discrete Mathematics in Computer Science Algorithms Combinatorics Computer programming Computers Computer science—Mathematics Algorithmus Berechnungskomplexität Komplexitätstheorie Semi-feasible Algorithm Computer |
| url | https://doi.org/10.1007/978-3-662-05080-4 |
| work_keys_str_mv | AT hemaspaandralanea theoryofsemifeasiblealgorithms AT torenvlietleen theoryofsemifeasiblealgorithms |