Над 4 милиона заглавия на английски и други езици! Открийте новата си история още днес! Безплатна доставка за поръчки над 69.99€

Проверка на състоянието на поръчката

Станете част от общност от любители на книгите от цял свят и получавате много предимства. Създай на безплатен акаунт

Безплатна доставка със Еконт над 69.99 €

Куриер Speedy 3.49 € Пункт на Speedy 3.49 € ЕКОНТ 3.99 € Еконтомат/Офис на Еконт 3.99 € Ekont Box 3.99 € Sameday 3.99 € Sameday box 3.99 € Box Now 3.99 €

Контакт

Как се пазарува?

Помощ

Моят акаунт

▸ Празна :-(

Randomness and Completeness in Computational Complexity

Name: Randomness and Completeness in Computational Complexity
Brand: Springer, Berlin
SKU: 02710666
Price: 54.46 EUR
Availability: InStock
Author: Dieter van Melkebeek
ISBN: 9783540414926

Dieter van Melkebeek

Език

Английски език

Книга С меки корици

Код Либристо: 02710666

Издателство Springer, Berlin, ноември 1999

This book contains a revised version of the dissertation the author wrote at the Department of Compu... Цялото описание

Код Либристо: 02710666

132 b

54.46 €

106.52 лв

Външен склад Изпращаме след 5-8 дни

30 дни за връщане на стоката

Клиентите са закупили също

Shiatsu Namikoshi SHIGERU ONODA

С меки корици

23.66 € 46.27 лв

Ester Egg: Precisamos falar sobre Deus! T. Rosa

С меки корици

9.42 € 18.42 лв

Vento Physique-Chimie Tle ST2S 2008 Manuel de l'élève René Vento

С меки корици

32.04 € 62.67 лв

365 activités avec mon bébé Roni Cohen Leiderman

С меки корици

16.61 € 32.49 лв

Navigatio sancti Brendani - Die Seereise des heiligen Brendan Katja Weidner

С твърди корици

45.97 € 89.91 лв

Funko POP Animation: Dragon Ball Super - Kale

Играчка

11.70 € 22.88 лв

Bortom rimligt tvivel : Thomas Quick och rattvisan Kwast

MP3

10.04 € 19.64 лв

Nietzsche y Ortega pensando Europa y a los europeos

С меки корици

31.53 € 61.66 лв

PequeŃO Libro De Egipto,El Amélie Poggi

С твърди корици

17.39 € 34.01 лв

Café Lugn Eeras Böcker

С меки корици

13.20 € 25.81 лв

Fuhrer zu den Thermalwassern der Insel Ischia Aniello Di Iorio

С меки корици

12.32 € 24.09 лв

Rechnungswesen Spedition und Logistikdienstleistung, Arbeitsheft Manfred Eberhardt

Лист

17.81 € 34.82 лв

Weg Der Welt. Visionen Der Hildegard Von Bingen ildegard von Bingen

С меки корици

12.42 € 24.29 лв

Todsunden Hermann Heiberg

С твърди корици

23.71 € 46.37 лв

Handgeschriebene Schriften Franz Endreß

С твърди корици

11.59 € 22.67 лв

Ambulante Täterarbeit Gernot Hahn

С меки корици

45.30 € 88.59 лв

Gregor Johann Mendel Hugo Iltis

С меки корици

66.16 € 129.40 лв

Das therapeutische Jahrzehnt Maik Tändler

С твърди корици

53.01 € 103.68 лв

Nożyczki zenoa fit szkolne asymetryczne 13 cm

Канцеларски материали

2.38 € 4.65 лв

Lebensqualitat bei Mammakarzinom-Patientinnen Karin Matoschitz

С меки корици

72.58 € 141.96 лв

Bajo el árbol de Navidad María Victoria Tejero La Rosa

С меки корици

21.12 € 41.31 лв

Introducción a la literatura griega C.M BOWRA

С меки корици

30.85 € 60.34 лв

El abismo del diablo DELAM HEINZ

С меки корици

14.54 € 28.44 лв

Die Rache der Frau in der Antike Katja Wilhelm

С меки корици

27.33 € 53.46 лв

This book contains a revised version of the dissertation the author wrote at the Department of Computer Science of the University of Chicago. The thesis was submitted to the Faculty of Physical Sciences in conformity with the requirements for the PhD degree in June 1999. It was honored with the 1999 ACM Doctoral Dissertation Award in May 2000. Summary Computational complexity is the study of the inherent di culty of compu- tional problems and the power of the tools we may use to solve them. It aims to describe how many resources we need to compute the solution as a function of the problem size. Typical resources include time on sequential and parallel architectures and memory space. As we want to abstract away from details of input representation and speci cs of the computer model, we end up with classes of problems that we can solve within certain robust resource bounds such as polynomial time, parallel logarithmic time, and logarithmic space. Research in complexity theory boils down to determining the relationships between these classes { inclusions and separations. In this dissertation, we focus on the role of randomness and look at various properties of hard problems in order to obtain separations. We also investigate the power of nondeterminism and alternation, as well as space versus time issues. Randomness provides a resource that seems to help in various situations.