Cargando…
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Otros Autores: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
Cambridge ; New York, NY, USA :
Cambridge University Press,
1992.
|
| Colección: | London Mathematical Society lecture note series ;
169. |
| Temas: | |
| Acceso en línea: | Texto completo |