Capa do artigo Boolean Function Complexity
10% OFF

Boolean Function Complexity eBook

Advances And Frontiers

by Stasys Jukna
language: english
Publisher: Springer Berlin Heidelberg, January of 2012 ‧
92,74€
10% OFF CARD
IMMEDIATE AVAILABILITY
Ebook for ADE
Boolean circuit complexity is the combinatorics of computer science and involves many intriguing problems that are easy to state and explain, even for the layman. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science.

Boolean Function Complexity

Advances And Frontiers

by Stasys Jukna

Property Description
ISBN: 9783642245084
Publisher: Springer Berlin Heidelberg
Release Date: January of 2012
Language: English
Format: eBook
File Format and Compatibility: PDF para ADE
Collection: Algorithms And Combinatorics
Categories: eBooks in English > Science > Mathematics
EAN: 9783642245084

BOOKS FROM THE SAME COLLECTION

SEE MORE TITLES FROM THIS COLLECTION

STASYS JUKNA

SEE MORE TITLES BY THIS AUTHOR