» » Feasible Computations and Provable Complexity Properties

Information of news
12-01-2015, 20:41

Feasible Computations and Provable Complexity Properties

Category: E-Books

Feasible Computations and Provable Complexity Properties
Juris Hartmanis - Feasible Computations and Provable Complexity Properties
Published: 1987-01-01 | ISBN: 0898710278 | PDF + DJVU | 70 pages | 5 MB

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.

Links are Interchangeable - No Password






Site BBcode/HTML Code:
Dear visitor, you went to the site as unregistered user.
We recommend you Sign up or Login to website under your name.
Would you like to leave your comment? Please Login to your account to leave comments. Don't have an account? You can create a free account now.

Tag Cloud

archive of news

free html hit counter