Computability and complexity theory:
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
New York [u.a.]
Springer
2001
|
| Series: | Texts in computer science
|
| Subjects: | |
| Online Access: | Inhaltsverzeichnis |
| Physical Description: | XIII, 194 S. |
| ISBN: | 0387950559 |
Staff View
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV013858864 | ||
| 003 | DE-604 | ||
| 005 | 20090831 | ||
| 007 | t| | ||
| 008 | 010807s2001 xx |||| 00||| eng d | ||
| 016 | 7 | |a 962205605 |2 DE-101 | |
| 020 | |a 0387950559 |9 0-387-95055-9 | ||
| 035 | |a (OCoLC)248650965 | ||
| 035 | |a (DE-599)BVBBV013858864 | ||
| 040 | |a DE-604 |b ger |e rakwb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-20 |a DE-824 |a DE-739 |a DE-29T |a DE-19 |a DE-634 |a DE-11 |a DE-2070s | ||
| 050 | 0 | |a QA76 | |
| 082 | 0 | |a 004 |2 21 | |
| 084 | |a ST 120 |0 (DE-625)143585: |2 rvk | ||
| 084 | |a ST 130 |0 (DE-625)143588: |2 rvk | ||
| 084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
| 100 | 1 | |a Homer, Steven |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Computability and complexity theory |c Steven Homer ; Alan L. Selman |
| 264 | 1 | |a New York [u.a.] |b Springer |c 2001 | |
| 300 | |a XIII, 194 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a Texts in computer science | |
| 650 | 7 | |a Berekenbaarheid |2 gtt | |
| 650 | 7 | |a Complexiteit |2 gtt | |
| 650 | 7 | |a Functies (wiskunde) |2 gtt | |
| 650 | 4 | |a Informatik | |
| 650 | 4 | |a Computable functions | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer science | |
| 650 | 0 | 7 | |a Berechnungstheorie |0 (DE-588)4005581-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Komplexitätstheorie |0 (DE-588)4120591-1 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Berechnungstheorie |0 (DE-588)4005581-4 |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 | |
| 700 | 1 | |a Selman, Alan L. |e Verfasser |4 aut | |
| 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=009478450&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |3 Inhaltsverzeichnis |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-009478450 | |
Record in the Search Index
| _version_ | 1816444333180583936 |
|---|---|
| adam_text |
CONTENTS
PREFACE
VII
1
PRELIMINARIES
1
1.1
WORDS
AND
LANGUAGES
.
1
1.2
A"-ADIC
REPRESENTATION
.
2
1.3
PARTIAL
FUNCTIONS
.
3
1.4
GRAPHS
.
4
1.5
PROPOSITIONAL
LOGIC
.
6
1.5.1
BOOLEAN
FUNCTIONS
.
8
1.6
CARDINALITY
.
8
1.6.1
ORDERED
SETS
.
10
1.7
ELEMENTARY
ALGEBRA
.
11
1.7.1
RINGS
AND
FIELDS
.
11
1.7.2
GROUPS
.
15
1.7.3
NUMBER
THEORY
.
17
2
INTRODUCTION
TO
COMPUTABILITY
22
2.1
TURING
MACHINES
.
23
2.2
TURING-MACHINE
CONCEPTS
.
26
2.3
VARIATIONS
OF
TURING
MACHINES
.
28
2.3.1
MULTITAPE
TURING
MACHINES
.
29
2.3.2
NONDETERMINISTIC
TURING
MACHINES
.
31
2.4
CHURCH
'
S
THESIS
.
34
2.5
RAMS
.
36
2.5.1
TURING
MACHINES
FOR
RAMS
.
39
XII
CONTENTS
3
UNDECIDABILITY
41
3.1
DECISION
PROBLEMS
.
41
3.2
UNDECIDABLE
PROBLEMS
.
43
3.3
PAIRING
FUNCTIONS
.
46
3.4
COMPUTABLY
ENUMERABLE
SETS
.
47
3.5
HALTING
PROBLEM,
REDUCTIONS,
AND
COMPLETE
SETS
.
50
3.5.1
COMPLETE
PROBLEMS
.
52
3.6
S-M-N
THEOREM
.
53
3.7
RECURSION
THEOREM
.
55
3.8
RICE
'
S
THEOREM
.
57
3.9
TURING
REDUCTIONS
AND
ORACLE
TURING
MACHINES
.
59
3.10
RECURSION
THEOREM,
CONTINUED
.
66
3.11
REFERENCES
.
69
3.12
ADDITIONAL
HOMEWORK
PROBLEMS
.
70
4
INTRODUCTION
TO
COMPLEXITY
THEORY
72
4.1
COMPLEXITY
CLASSES
AND
COMPLEXITY
MEASURES
.
74
4.1.1
COMPUTING
FUNCTIONS
.
76
4.2
PREREQUISITES
.
77
5
BASIC
RESULTS
OF
COMPLEXITY
THEORY
78
5.1
LINEAR
COMPRESSION
AND
SPEEDUP
.
80
5.2
CONSTRUCTIBLE
FUNCTIONS
.
86
5.2.1
SIMULTANEOUS
SIMULATION
.
87
5.3
TAPE
REDUCTION
.
90
5.4
INCLUSION
RELATIONSHIPS
.
97
5.4.1
RELATIONS
BETWEEN
THE
STANDARD
CLASSES
.
105
5.5
SEPARATION
RESULTS
.
107
5.6
TRANSLATION
TECHNIQUES
AND
PADDING
.
ILL
5.6.1
TALLY
LANGUAGES
.
113
5.7
RELATIONS
BETWEEN
THE
STANDARD
CLASSES
-
CONTINUED
.
115
5.7.1
COMPLEMENTS
OF
COMPLEXITY
CLASSES:
THE
IMMERMAN-SZELEPCSENYI
THEOREM
.
116
5.8
ADDITIONAL
HOMEWORK
PROBLEMS
.
120
6
NONDETERMINISM
AND
NP-COMPLETENESS
122
6.1
CHARACTERIZING
NP
.
123
6.2
THE
CLASS
P
.
124
6.3
ENUMERATIONS
.
126
6.4
NP-COMPLETENESS
.
128
6.5
THE
COOK-LEVIN
THEOREM
.
130
6.6
MORE
NP-COMPLETE
PROBLEMS
.
136
6.6.1
THE
DIAGONAL
SET
IS
NP-COMPLETE
.
137
6.6.2
SOME
NATURAL
NP-COMPLETE
PROBLEMS
.
138
CONTENTS
XIII
6.7
ADDITIONAL
HOMEWORK
PROBLEMS
.
142
7
RELATIVE
COMPUTABILITY
145
7.1
NP-HARDNESS
.
147
7.2
SEARCH
PROBLEMS
.
151
7.3
THE
STRUCTURE
OF
NP
.
153
7.3.1
COMPOSITE
NUMBER
AND
GRAPH
ISOMORPHISM
.
158
7.3.2
REFLECTION
.
161
7.4
THE
POLYNOMIAL
HIERARCHY
.
162
7.5
COMPLETE
PROBLEMS
FOR
OTHER
COMPLEXITY
CLASSES
.
170
7.5.1
PSPACE
.
170
7.5.2
EXPONENTIAL
TIME
.
174
7.5.3
POLYNOMIAL
TIME
AND
LOGARITHMIC
SPACE
.
175
7.5.4
A
NOTE
ON
PROVABLY
INTRACTABLE
PROBLEMS
.
179
7.6
ADDITIONAL
HOMEWORK
PROBLEMS
.
179
REFERENCES
181
AUTHOR
INDEX
187
SUBJECT
INDEX
191 |
| any_adam_object | 1 |
| author | Homer, Steven Selman, Alan L. |
| author_facet | Homer, Steven Selman, Alan L. |
| author_role | aut aut |
| author_sort | Homer, Steven |
| author_variant | s h sh a l s al als |
| building | Verbundindex |
| bvnumber | BV013858864 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| classification_rvk | ST 120 ST 130 ST 134 |
| ctrlnum | (OCoLC)248650965 (DE-599)BVBBV013858864 |
| dewey-full | 004 |
| dewey-hundreds | 000 - Computer science, information, general works |
| dewey-ones | 004 - Computer science |
| dewey-raw | 004 |
| dewey-search | 004 |
| dewey-sort | 14 |
| dewey-tens | 000 - Computer science, information, general works |
| discipline | Informatik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000 c 4500</leader><controlfield tag="001">BV013858864</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20090831</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">010807s2001 xx |||| 00||| eng d</controlfield><datafield tag="016" ind1="7" ind2=" "><subfield code="a">962205605</subfield><subfield code="2">DE-101</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0387950559</subfield><subfield code="9">0-387-95055-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)248650965</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV013858864</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-20</subfield><subfield code="a">DE-824</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-29T</subfield><subfield code="a">DE-19</subfield><subfield code="a">DE-634</subfield><subfield code="a">DE-11</subfield><subfield code="a">DE-2070s</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">004</subfield><subfield code="2">21</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 120</subfield><subfield code="0">(DE-625)143585:</subfield><subfield code="2">rvk</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">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Homer, Steven</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Computability and complexity theory</subfield><subfield code="c">Steven Homer ; Alan L. Selman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York [u.a.]</subfield><subfield code="b">Springer</subfield><subfield code="c">2001</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">XIII, 194 S.</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">Texts in computer science</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Berekenbaarheid</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Complexiteit</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Functies (wiskunde)</subfield><subfield code="2">gtt</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Informatik</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computable functions</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer science</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-4</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="689" ind1="0" ind2="0"><subfield code="a">Berechnungstheorie</subfield><subfield code="0">(DE-588)4005581-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">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="700" ind1="1" ind2=" "><subfield code="a">Selman, Alan L.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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=009478450&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA</subfield><subfield code="3">Inhaltsverzeichnis</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-009478450</subfield></datafield></record></collection> |
| id | DE-604.BV013858864 |
| illustrated | Not Illustrated |
| indexdate | 2024-11-22T17:25:07Z |
| institution | BVB |
| isbn | 0387950559 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-009478450 |
| oclc_num | 248650965 |
| open_access_boolean | |
| owner | DE-20 DE-824 DE-739 DE-29T DE-19 DE-BY-UBM DE-634 DE-11 DE-2070s |
| owner_facet | DE-20 DE-824 DE-739 DE-29T DE-19 DE-BY-UBM DE-634 DE-11 DE-2070s |
| physical | XIII, 194 S. |
| publishDate | 2001 |
| publishDateSearch | 2001 |
| publishDateSort | 2001 |
| publisher | Springer |
| record_format | marc |
| series2 | Texts in computer science |
| spelling | Homer, Steven Verfasser aut Computability and complexity theory Steven Homer ; Alan L. Selman New York [u.a.] Springer 2001 XIII, 194 S. txt rdacontent n rdamedia nc rdacarrier Texts in computer science Berekenbaarheid gtt Complexiteit gtt Functies (wiskunde) gtt Informatik Computable functions Computational complexity Computer science Berechnungstheorie (DE-588)4005581-4 gnd rswk-swf Komplexitätstheorie (DE-588)4120591-1 gnd rswk-swf Berechnungstheorie (DE-588)4005581-4 s DE-604 Komplexitätstheorie (DE-588)4120591-1 s Selman, Alan L. Verfasser aut DNB Datenaustausch application/pdf http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009478450&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA Inhaltsverzeichnis |
| spellingShingle | Homer, Steven Selman, Alan L. Computability and complexity theory Berekenbaarheid gtt Complexiteit gtt Functies (wiskunde) gtt Informatik Computable functions Computational complexity Computer science Berechnungstheorie (DE-588)4005581-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| subject_GND | (DE-588)4005581-4 (DE-588)4120591-1 |
| title | Computability and complexity theory |
| title_auth | Computability and complexity theory |
| title_exact_search | Computability and complexity theory |
| title_full | Computability and complexity theory Steven Homer ; Alan L. Selman |
| title_fullStr | Computability and complexity theory Steven Homer ; Alan L. Selman |
| title_full_unstemmed | Computability and complexity theory Steven Homer ; Alan L. Selman |
| title_short | Computability and complexity theory |
| title_sort | computability and complexity theory |
| topic | Berekenbaarheid gtt Complexiteit gtt Functies (wiskunde) gtt Informatik Computable functions Computational complexity Computer science Berechnungstheorie (DE-588)4005581-4 gnd Komplexitätstheorie (DE-588)4120591-1 gnd |
| topic_facet | Berekenbaarheid Complexiteit Functies (wiskunde) Informatik Computable functions Computational complexity Computer science Berechnungstheorie Komplexitätstheorie |
| url | http://bvbr.bib-bvb.de:8991/F?func=service&doc_library=BVB01&local_base=BVB01&doc_number=009478450&sequence=000001&line_number=0001&func_code=DB_RECORDS&service_type=MEDIA |
| work_keys_str_mv | AT homersteven computabilityandcomplexitytheory AT selmanalanl computabilityandcomplexitytheory |