The counting complexity of group-definable languages

Vikraman Arvind, N. V. Vinodchandran. The counting complexity of group-definable languages. Theoretical Computer Science, 242(1-2):199-218, 2000. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.