Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Vikraman Arvind' in GoogleThis author has not been identified. Look up 'Piyush P. Kurur' in GoogleThis author has not been identified. Look up 'T. C. Vijayaraghavan' in Google

runs on WebDSL