#P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method

Camille Noûs, Kévin Perrot, Sylvain Sené, Lucas Venturini. #P-completeness of Counting Update Digraphs, Cacti, and Series-Parallel Decomposition Method. In Marcella Anselmo, Gianluca Della Vedova, Florin Manea, Arno Pauly, editors, Beyond the Horizon of Computability - 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29 - July 3, 2020, Proceedings. Volume 12098 of Lecture Notes in Computer Science, pages 326-338, Springer, 2020. [doi]

Authors

Camille Noûs

This author has not been identified. Look up 'Camille Noûs' in Google

Kévin Perrot

This author has not been identified. Look up 'Kévin Perrot' in Google

Sylvain Sené

This author has not been identified. Look up 'Sylvain Sené' in Google

Lucas Venturini

This author has not been identified. Look up 'Lucas Venturini' in Google