Circuit complexity
Автор:
Jesse Russell,Ronald Cohn, ISBN:
978-5-5107-4442-2
High Quality Content by WIKIPEDIA articles! In theoretical computer science, circuit complexity is a branch of computational complexity theory in which Boolean functions are classified according to the size or depth of Boolean circuits that compute...
| В наличии: |
|
Books.Ru - 1258 руб.
|
Перейти
|
|
|
Рейтинг книги:



4 из 5,
9 голос(-ов).