Zbog tehničkih razloga telefonska podrška danas neće biti dostupna, molimo kontaktirajte nas putem e-maila.

Provjerite status narudžbe

Pridružite se zajednici ljubitelja knjige iz cijelog svijeta i ostvarite mnoštvo pogodnosti. Izradite besplatni račun

Besplatna dostava Overseas kurirskom službom iznad 69.99 €

DPD kurir 3.99 € DPD točka 3.49 € GLS Kurir 4.99 € GLS paketomat 3.99 € Hrvatska pošta 4.99 € Dostava Overseas 4.99 € Box Now 4.49 €

Kontakt

Kako kupovati

Pomoć

Moj račun

▸ Prazno :-(

Zbog tehničkih razloga telefonska podrška danas neće biti dostupna, molimo kontaktirajte nas putem e-maila.

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.11 EUR
Availability: InStock
Author: Juris Hartmanis
ISBN: 9780898710274

Juris Hartmanis

Jezik

Engleski

Knjiga Meki uvez

Libristo kod: 02049972

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

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

Libristo kod: 02049972

95 b

39.11 €

50 % šanse Pretražit ćemo cijeli svijet Kada ću dobiti knjigu?

Do 30 dana za povrat

Kupci su kupili i

Adel Und Politik Tatjana Tönsmeyer

Meki uvez

66.86 €

Identifikation dynamischer Systeme Heinz Unbehauen

Meki uvez

56.30 €

AnfÃ]gtelser Peter Egge

Meki uvez

19.20 €

Sail cruising and yachtmaster

Meki uvez

4.82 €

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

Meki uvez

35.49 €

SOMBRAS DE PODER Cristina Lobo

Meki uvez

24.93 €

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

Meki uvez

18.49 €

CUENTOS GONZÁLEZ ÁLVAREZ

Meki uvez

22.01 €

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

Meki uvez

13.16 €

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

Meki uvez

41.82 €

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

Meki uvez

16.08 €

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

Meki uvez

76.61 €

Homo Erraticus Ian Anderson

Audio CD

17.79 €

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

Meki uvez

176.26 €

Souvenirs de jeunesse 1939 - 1945 Paul Kalt

Meki uvez

6.73 €

Die große Hitze Jörg Mauthe

Meki uvez

17.89 €

Die Verrenkungen der Knochen Carl Gottlieb Burger

Meki uvez

24.93 €

Courte Et Bonne Colombier-M

Meki uvez

20.40 €

Neue Werkausgabe in 21 Bänden Walter Benjamin

Tvrdi uvez

1 328.42 €

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

Meki uvez

11.25 €

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.