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.
A sweeping classification theory for computational counting problems using new techniques and theories.
