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: 9783519021070

Ingo Wegener

0 / 0

0 comments

دا کتاب تاسو ته څنګه خواښه شوه؟

د بار شوي فایل کیفیت څه دئ؟

تر څو چې د کتاب کیفیت آزمایښو وکړئ، بار ئې کړئ

د بار شوو فایلونو کیفیتی څه دئ؟

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.

درجه (قاطیغوری(:

Mathematics

کال:

1991

خپرندویه اداره:

Wiley

ژبه:

english

صفحه:

469

ISBN 10:

3519021072