Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy

Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan. Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. In 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 11-15 June 2005, San Jose, CA, USA. pages 13-27, IEEE Computer Society, 2005. [doi]

Abstract

Abstract is missing.