Livraison gratuite à partir de 69.99 euros.

Vérifier l'état de la commande

Accédez à une communauté d'amateurs de livres à travers le monde et bénéficiez d’une panoplie d'avantages. Créer un compte gratuitement

Livraison gratuite avec Zásilkovna à partir de 69.99 €

Coursier DPD 5.99 € Point Bpost 7.99 € Bpost 7.49 € Point DPD 3.49 € Service de messagerie GLS 4.99 €

Contact

Comment faire ses achats

Assistance

Mon compte

▸ Vide :-(

Livraison gratuite à partir de 69.99 euros.

Boolean Functions and Computation Models

Name: Boolean Functions and Computation Models
Brand: Springer, Berlin
SKU: 01653254
Price: 77.23 EUR
Availability: InStock
Author: Peter Clote
ISBN: 9783642082177

Peter Clote

Evangelos Kranakis

Langue

Anglais

Livre Livre de poche

Code Libristo: 01653254

Éditeurs Springer, Berlin, octobre 2010

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its... Description détaillée

Code Libristo: 01653254

187 b

77.23 €

Stockage externe Expédition sous 5-8 jours

Jusqu'à 30 jours pour les retours

Les clients ont également acheté

Weitblick in Teilbanden Claudia Böschel

Livre de poche

27.08 €

complexidade na educacao e na organizacao do trabalho formal Da Silva Juarez Francisco

Livre de poche

37.39 €

Fotbalový pohár Jaroslav Kolář

Livre relié

21.52 €

Timur und sein Trupp Arkadi Gaidar

Livre relié

11.01 €

Fühl dich wohl, m. 2 Audio-CDs Bianca Joggerst

Livre de poche

21.02 €

Kita aktiv Projektmappe "Piraten" Cornelia Emde

Feuille

13.84 €

Bandera Orlan Mac

Livre de poche

8.18 €

Pendant La Revolution ARENE-J

Livre de poche

20.31 €

Manual de modelado y animación con Blender Pablo Suau Pérez

Livre de poche

27.99 €

EDEN´S BOWY 02 (COMIC)

Livre de poche

10.20 €

Cinderella (Puzzle) Thomas Kinkade

Jeu

13.33 €

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its complexity is emphasised through a variety of techniques ranging from finite combinatorics, probability theory and finite group theory to finite model theory and proof theory. Non-uniform computation models are studied in the form of Boolean circuits; uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems. Providing a survey of research in the field, the book will benefit advanced undergraduates and graduate students as well as researchers.This textbook presents a survey of research on boolean functions, circuits, parallel computation models, function algebras, and proof systems. Its main aim is to elucidate the structure of "fast" parallel computation. The complexity of parallel computation is emphasized through a variety of techniques ranging from finite combinatorics, probability theory, and finite group theory to finite model theory and proof theory. Nonuniform computation models are studied in the form of boolean circuits, uniform ones in a variety of forms. Steps in the investigation of non-deterministic polynomial time are surveyed as is the complexity of various proof systems.The book will benefit advanced undergraduate and graduate students as well as researchers in the field of complexity theory.