The complexity of Boolean functions

Free Download

Authors:

Series: Wiley Teubner on Applicable Theory in Computer Science

ISBN: 9780471915553, 0471915556

Size: 842 kB (862364 bytes)

Pages: 470/469

File format:

Language:

Publishing Year:

Category:

Ingo Wegener9780471915553, 0471915556

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.

Reviews

There are no reviews yet.

Be the first to review “The complexity of Boolean functions”
Shopping Cart
Scroll to Top