Boolean function complexity
| Други автори: | Paterson, Michael S. |
|---|---|
| Формат: | Електронен |
| Език: | English |
| Публикувано: |
Cambridge ; New York, NY, USA :
Cambridge University Press,
1992.
|
| Серия: |
London Mathematical Society lecture note series ;
169. |
| Предмети: | |
| Онлайн достъп: |
http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=552529 |
| Подобни документи: |
Print version::
Boolean function complexity. |
| Описание на библ. документ: |
Papers from the Symposium on Boolean Function Complexity, held July, 1990, at Durham University and sponsored by the London Mathematical Society. |
|---|---|
| Физически характеристики: |
1 online resource (201 pages) : illustrations. |
| Библиография: |
Includes bibliographical references (pages 198-201). |
| ISBN: |
9781107361720 1107361729 9780511526633 0511526636 |