What is it about?
This work presents a solid theorem in the area of the counting complexity. It presents an FP^NP vs. #P classification theorem for complex #EO problems.
Featured Image
Why is it important?
Computational complexity classfications are natural and essential problems in theoretical computer science. #EO is a expressive framework of counting problems. This work builds a cornerstone towards the complexity classfication for complex Holant problems.
Read the Original
This page is a summary of: The FPᴺᴾ versus #P Dichotomy for #EO, June 2025, ACM (Association for Computing Machinery),
DOI: 10.1145/3717823.3718135.
You can read the full text:
Contributors
The following have contributed to this page
