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

DPD courier 4.99 € GLS courier 9.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: 39.1 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

95 b

39.10 €

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

Up to 30 days for returns

Customers also purchased

Adel Und Politik Tatjana Tönsmeyer

Paperback

66.84 €

Identifikation dynamischer Systeme Heinz Unbehauen

Paperback

56.29 €

AnfÃ]gtelser Peter Egge

Paperback

19.19 €

Sail cruising and yachtmaster

Paperback

4.92 €

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

Paperback

35.48 €

SOMBRAS DE PODER Cristina Lobo

Paperback

24.92 €

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

Paperback

18.49 €

CUENTOS GONZÁLEZ ÁLVAREZ

Paperback

22.91 €

Fiches et méthodes de Mathématiques - Première ES Fraissinet

Paperback

13.56 €

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

Paperback

41.81 €

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

Paperback

16.08 €

Vergleichende Betrachtung Der Verfahren Zur Prufung Der Plastischen Eigenschaften Metallischer Werkstoffe K. Pöhlandt

Paperback

76.60 €

Homo Erraticus Ian Anderson

Audio CD

17.78 €

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

Paperback

176.23 €

Souvenirs de jeunesse 1939 - 1945 Paul Kalt

Paperback

6.73 €

Die große Hitze Jörg Mauthe

Paperback

17.88 €

Die Verrenkungen der Knochen Carl Gottlieb Burger

Paperback

24.92 €

Courte Et Bonne Colombier-M

Paperback

21.50 €

Neue Werkausgabe in 21 Bänden Walter Benjamin

Hardback

1 328.14 €

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

Paperback

11.85 €

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.