10% OFF

Boolean Function Complexity

Advances And Frontiers

by Stasys Jukna
language: english
Publisher: SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG, February of 2014 ‧
71,64€
10% OFF CARD
free shipping
Sell ​​your book
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: 9783642431449
Publisher: SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG
Release Date: February of 2014
Language: English
Dimensions: 155 x 235 x 36 mm
Cover: Softcover
Pages: 620
Format: Book
Collection: Algorithms And Combinatorics
Categories: Books in English > Science > Mathematics
Books in English > Others
EAN: 9783642431449

BOOKS FROM THE SAME COLLECTION