Feasible Computations and Provable Complexity Properties (CBMS-NSF Regional Conference Series in Applied Mathematics) [Paperback]

Juris Hartmanis (Author)

Book Description

ISBN-10: 0898710278 | ISBN-13: 978-0898710274 | Publication Date: January 1, 1987

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.

Editorial Reviews

Book Description

An overview of current developments in research on feasible computations. Defines and discusses efficient reductions between problems and considers the families and corresponding complete languages of NL, DCSL, CSL, P, NP, PTAPE, EXPTIME, and EXPTAPE.

Product Details

• Paperback: 70 pages
• Publisher: Society for Industrial Mathematics (January 1, 1987)
• Language: English
• ISBN-10: 0898710278
• ISBN-13: 978-0898710274
• Product Dimensions: 9.4 x 6.5 x 0.2 inches
• Shipping Weight: 4.8 ounces (View shipping rates and policies)
• Amazon Best Sellers Rank: #6,055,432 in Books (See Top 100 in Books)