Title :
On closure properties of #P in the context of PF {omicron} #P
Author :
Ogiwara, Mitsunori ; Thierauf, Thomas ; Toda, Seinosuke ; Watanabe, Osamu
Author_Institution :
Dept. of Comput. Sci., Univ. Electro-Commun., Tokyo, Japan
Abstract :
It is shown that while absolute answers to open questions about relationships between counting classes seem hard to get, it is still possible to obtain relative answers that help us to develop intuition about or understanding of these relationships. In particular, a structural approach to extending such understanding is proposed
Keywords :
computational complexity; closure properties; complexity; counting classes; structural approach; Collaborative work; Computer science; Marine vehicles; Polynomials;
Conference_Titel :
Structure in Complexity Theory Conference, 1993., Proceedings of the Eighth Annual
Conference_Location :
San Diego, CA
Print_ISBN :
0-8186-4070-7
DOI :
10.1109/SCT.1993.336532
