Characterizations and approximability of hard counting classes below \#\textsf{P}

DOI10.1007/978-3-030-59267-7_22OpenAlexW3107240407MaRDI QIDQ2110717

Aggeliki Chalki, Eleni Bakali, Aris Pagourtzis

Publication date: 22 December 2022

Full work available at URL: https://arxiv.org/abs/2003.02524

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Completeness, approximability and exponential time results for counting problems with easy decision version

This page was built for publication: Characterizations and approximability of hard counting classes below \#\textsf{P}