Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain - Cai, Jin-Yi (University of Wisconsin, Madison) - Books - Cambridge University Press - 9781107062375 - November 16, 2017
In case cover and title do not match, the title is correct

Cai, Jin-Yi (University of Wisconsin, Madison)
Complexity Dichotomies for Counting Problems: Volume 1, Boolean Domain

Price
HK$ 1,610
excl. VAT

Ordered from remote warehouse

Expected to be ready for shipping Jul 29 - Aug 10
Get notified about new Cai, Jin-Yi (University of Wisconsin, Madison) releases

Our customers say:

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

Not rated yet

Complexity theory aims to understand and classify computational problems according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems on the Boolean domain and is broadly accessible to researchers and graduate students.

320 pages

Media Books     Hardcover Book   (Book with hard spine and cover)
Released November 16, 2017
ISBN13 9781107062375
Publishers Cambridge University Press
Pages 470
Dimensions 158 × 236 × 30 mm   ·   757 g

More from the same publisher

See all of Cai, Jin-Yi (University of Wisconsin, Madison) ( e.g. Hardcover Book )