Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Punto Poste 5.49 € Punto Poste 5.49 € Corriere DHL 6.99 € Corriere GLS 5.99 € Punto GLS 4.49 € Corriere Bartolini 4.49 € Punto Bartolini 3.49 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Boolean Functions and Computation Models

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

Peter Clote

Evangelos Kranakis

Lingua

Inglese

Libro In brossura

Codice Libristo: 01653254

Casa editrice Springer, Berlin, ottobre 2010

The two internationally renowned authors elucidate the structure of "fast" parallel computation. Its... Descrizione completa

Codice Libristo: 01653254

197 b

80.49 €

Magazzino esterno Inviamo tra 5-8 giorni

Fino a 30 giorni per il reso

I clienti hanno acquistato anche

Weitblick in Teilbanden Claudia Böschel

In brossura

18.39 €

parlamentarische Regierungssystem der Bundesrepublik Deutschland Marko Rossmann

In brossura

16.00 €

Timur und sein Trupp Arkadi Gaidar

Rigido

11.59 €

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

In brossura

20.80 €

Bandera Orlan Mac

In brossura

8.59 €

Kita aktiv Projektmappe "Piraten" Cornelia Emde

Foglio

14.49 €

Caída Álvaro García

In brossura

8.39 €

Pendant La Revolution ARENE-J

In brossura

20.09 €

EDEN´S BOWY 02 (COMIC)

In brossura

10.59 €

Cinderella (Puzzle) Thomas Kinkade

Gioco

15.59 €

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

In brossura

39.19 €

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.