CBMS-NSF Regional Conference Series in Applied Mathematics 30
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.
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.
1978 / vii + 62 pages / Softcover / ISBN-13: 978-0-898710-27-4 / ISBN-10: 0-89871-027-8 /
List Price $81.50 / SIAM/CBMS Member Price $57.05 / Order Code CB30