The Complexity of Boolean Functions (Wiley Teubner on...

Main
Mathematics
The Complexity of Boolean Functions...

The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)

Name: The Complexity of Boolean Functions (Wiley Teubner on Applicable Theory in Computer Science)
ISBN: 9780471915553

Ingo Wegener

0 / 0

0 comments

Bu kitabı ne kadar beğendiniz?

İndirilen dosyanın kalitesi nedir?

Kalitesini değerlendirmek için kitabı indirin

İndirilen dosyaların kalitesi nedir?

Presents a large number of recent research results previously unavailable in book form. Initially deals with the wee-known computation models, and goes on to special types of circuits, parallel computers, and branching programs. Includes basic theory as well recent research findings. Each chapter includes exercises.

Kategoriler:

Mathematics

Yıl:

1991

Baskı:

Yayımcı:

Wiley

Dil:

english

Sayfalar:

470

ISBN 10: