Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Austrian Post 5.49 € DPD courier 3.99 € DPD point 2.99 €

Contact

How to shop

Help

My account

▸ Empty :-(

Feasible Computations and Provable Complexity Properties

Name: Feasible Computations and Provable Complexity Properties
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 02049972
Price: 56.79 EUR
Availability: InStock
Author: Juris Hartmanis
ISBN: 9780898710274

Juris Hartmanis

Language

English

Book Paperback

Libristo code: 02049972

Publishers Society for Industrial & Applied Mathematics,U.S.

An overview of current developments in research on feasible computations; and a consideration of thi... Full description

Libristo code: 02049972

139 b

56.79 € VAT included

50 % chance We search the world When will I receive my book?

Delivery to Austria

30-day return policy

Customers also purchased

Quando accadranno queste cose? Apocalisse e fine dei tempi nella rivelazione cristiana Gianluca Marletta

Paperback

19.39 €

SOMBRAS DE PODER Cristina Lobo

Paperback

25.99 €

Adel Und Politik Tatjana Tönsmeyer

Paperback

69.89 €

El uso de las nuevas tecnologías para mejorar la calidad de la ense?anza pública

Paperback

37.29 €

Identifikation dynamischer Systeme Heinz Unbehauen

Paperback

66.49 €

Sail cruising and yachtmaster

Paperback

5.29 €

Denkwurdigkeiten Und Der Christlichen Archaologie V1 (1880) Johann Christian Wilhelm Augusti

Paperback

43.59 €

Armenfursorge bei Wilhelm Loehe und das Werk "Das Armenwesen nach all seinen Richtungen... von Charles Duchatel und Francois Naville Michael Martin Nachtrab

Paperback

17.95 €

Schopenhauers falsche Auslegung der Kantischen Erkenntnistheorie Otto Suckau

Paperback

26.90 €

Die große Hitze Jörg Mauthe

Paperback

21.59 €

Die Verrenkungen der Knochen Carl Gottlieb Burger

Paperback

27.90 €

Courte Et Bonne Colombier-M

Paperback

22.99 €

Software Libre como una alernativa tecnologica de soporte Ceballos Macias Jorge Daniel

Paperback

52.89 €

Souvenirs de jeunesse 1939 - 1945 Paul Kalt

Paperback

13.09 €

Des Droits Politiques Des Colons Et Des Hommes de Couleur Legat-B-J

Paperback

13.19 €

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.