On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)

DOI10.1006/jcss.1996.0059zbMath0859.68030OpenAlexW2137438459MaRDI QIDQ1816726

Seinosuke Toda, Thomas Thierauf, Osamu Watanabe, Ogihara, Mitsunori

Publication date: 31 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0059

zbMATH Keywords

counting problems

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (4)

Cluster computing and the power of edge recognition ⋮ The consequences of eliminating NP solutions ⋮ On the Complexity of the Pancake Problem ⋮ Unnamed Item

This page was built for publication: On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\)