Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

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

Free delivery for purchases over 19 990 Ft

DPD point 990 Ft DPD courier 1 190 Ft GLS point 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft GLS courier 1 690 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Feasible Computations and Provable Complexity Properties

Name: Feasible Computations and Provable Complexity Properties
Brand: Society for Industrial & Applied Mathematics,U.S.
SKU: 02049972
Price: 14902 HUF
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

102 b

14 902 Ft

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

Up to 30 days for returns

Customers also purchased

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

Paperback

7 152 Ft

SOMBRAS DE PODER Cristina Lobo

Paperback

9 545 Ft

Adel Und Politik Tatjana Tönsmeyer

Paperback

25 731 Ft

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

Paperback

13 775 Ft

Identifikation dynamischer Systeme Heinz Unbehauen

Paperback

21 760 Ft

Sail cruising and yachtmaster

Paperback

1 767 Ft

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

Paperback

16 011 Ft

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

Paperback

6 245 Ft

Homo Erraticus Ian Anderson

Audio CD

6 816 Ft

Schopenhauers falsche Auslegung der Kantischen Erkenntnistheorie Otto Suckau

Paperback

9 324 Ft

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

Paperback

17 194 Ft

Die große Hitze Jörg Mauthe

Paperback

6 963 Ft

Die Verrenkungen der Knochen Carl Gottlieb Burger

Paperback

9 660 Ft

Courte Et Bonne Colombier-M

Paperback

8 436 Ft

Souvenirs de jeunesse 1939 - 1945 Paul Kalt

Paperback

2 582 Ft

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

Paperback

4 202 Ft

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.