Boolean function complexity /
By considering the size of the logical network needed to perform a given computational task, the intrinsic difficulty of that task can be examined. Boolean function complexity, the combinatorial study of such networks, is a subject that started back in the 1950s and has today become one of the most...
| Other Authors: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Cambridge ; New York, NY, USA :
Cambridge University Press,
1992
|
| Series: | London Mathematical Society lecture note series ;
169 |
| Subjects: |
Internet
This item is not available through BorrowDirect. Please contact your institution’s interlibrary loan office for further assistance.Stanford University
| Call Number: |
INTERNET RESOURCE |
|---|