Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Boolean Function Complexity: Advances and Frontiers

by Stasys Jukna
Save 35% Save 35%
Current price ₹8,079.00
Original price ₹12,429.00
Original price ₹12,429.00
Original price ₹12,429.00
(-35%)
₹8,079.00
Current price ₹8,079.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9783642245077
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 620
  • Original Price: EUR 109.99
  • Language: English
  • Edition: N/A
  • Item Weight: 976 grams
  • BISAC Subject(s): Applied, Computer Science, and Discrete Mathematics

From the Back Cover

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. This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this "complexity Waterloo" that have been discovered over the past several decades, right up to results from the last year or two. Many open problems, marked as Research Problems, are mentioned along the way. The problems are mainly of combinatorial flavor but their solutions could have great consequences in circuit complexity and computer science. The book will be of interest to graduate students and researchers in the fields of computer science and discrete mathematics.

http: //www.thi.informatik.uni-frankfurt.de/ jukna/

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us