Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics - Stasys Jukna - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642245077 - January 6, 2012
In case cover and title do not match, the title is correct

Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics

Stasys Jukna

Price
$ 115.99
excl. VAT

Ordered from remote warehouse

Expected delivery Jul 29 - Aug 8

Our customers say:

14-day return policy in accordance with European consumer protection law
Top ranking on Trustpilot
Add to your iMusic wish list

Also available as:

Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics

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.

621 pages, biography

Media Books     Hardcover Book   (Book with hard spine and cover)
Released January 6, 2012
ISBN13 9783642245077
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 620
Dimensions 165 × 242 × 39 mm   ·   1.08 kg
Language German  
Show all

More by Stasys Jukna

See all of Stasys Jukna ( e.g. Paperback Book and Hardcover Book )