|
Login to ask the library to add a book.
|
|
Active Filter Settings
No Active Filters
|
|
|
|
|
first record
| previous record
| next record
| last record
|
full | marc
|
Record 1 of 1
|
|
| |
Total Requests 0 Unsatisfied Requests 0
|
|
You searched IISERK - Subject: Red knot MigrationzDelaware Bay (Del. and N.J.)
|
| Request |
|
|
Call Number
|
519.4
|
|
Author
|
Hartmanis, Juris.
|
|
Title
|
Feasible computations and provable complexity properties [electronic resource] / Juris Hartmanis.
|
|
Publication
|
Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 1978.
|
|
Material Info.
|
1 electronic text (vii, 62 p.) : digital file.
|
|
Series
|
CBMS-NSF regional conference series in applied mathematics ; 30
|
|
Series
|
CBMS-NSF regional conference series in applied mathematics ; 30.
|
|
Summary Note
|
An overview of current developments in research on feasible computations; and a consideration of this area of research in relation to provable properties of complexity of computations. The author begins by defining and discussing efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE. Definitions and results are uniformly extended to computationally simpler natural families of languages such as NL, P, and CSL by using Log n-tape bounded reductions. The problem of determining what can and cannot be formally proven about running times of algorithms is discussed and related to the problem of establishing sharp time bounds for one-tape Turing machine computations, and the inability to formally prove running times for algorithms is then related to the presence of gaps in the hierarchy of complexity classes. The concluding discussion is on the possibility that the famous P=NP? problem is independent of the axioms of formal mathematical systems such as set theory.
|
|
Notes
|
Includes bibliographical references (p. 61-62).
|
|
Notes
|
Reductions and complete sets -- L-isomorphisms of complete sets -- Structure of complete sets -- Long proofs of trivial theorems -- What can and cannot be proven about computational complexity -- Relativized P NP problem.
|
|
ISBN
|
9781611970395 (electronic bk.)
|
|
Subject
|
Machine theory.
|
|
Subject
|
Formal languages.
|
|
Subject
|
Computational complexity.
|
|
Subject
|
Feasible computations
|
|
Subject
|
Reductions
|
|
Subject
|
Complete sets
|
|
Subject
|
L-isomorphisms
|
|
Added Entry
|
Society for Industrial and Applied Mathematics.
|
|
Date
|
Year, Month, Day:01405141
|
|
Link
|
SIAM
|
|
|
|
|
