Descriptive Complexity for counting complexity classes
logic in computer science, 2017.
Descriptive Complexity has been very successful in characterizing complexity classes of decision problems in terms of the properties definable in some logics. However, descriptive complexity for counting complexity classes, such as FP and #P, has not been systematically studied, and it is not as developed as its decision counterpart. In t...More
PPT (Upload PPT)