Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics - Stasys Jukna - Books - Springer-Verlag Berlin and Heidelberg Gm - 9783642431449 - February 22, 2014
In case cover and title do not match, the title is correct

Stasys Jukna
Boolean Function Complexity: Advances and Frontiers - Algorithms and Combinatorics 2012 edition

Price
A$ 129.49
excl. VAT

Ordered from remote warehouse

Expected delivery Jan 9 - 21, 2026
Christmas presents can be returned until 31 January

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 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.

620 pages, biography

Media Books     Paperback Book   (Book with soft cover and glued back)
Released February 22, 2014
ISBN13 9783642431449
Publishers Springer-Verlag Berlin and Heidelberg Gm
Pages 620
Dimensions 155 × 235 × 36 mm   ·   861 g
Language English  

More by Stasys Jukna

Show all

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