The counting complexity of group-definable languages
type: Item
instance of: scholarly article
title: The counting complexity of group-definable languages
zbMATH Open document ID: 0944.68067
DOI: 10.1016/S0304-3975(98)00218-7
author: Vikraman Arvind
author: N. V. Vinodchandran
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 1493358
zbMATH Keywords: group family
zbMATH Keywords: group definable languages
zbMATH Keywords: NP-complete
MaRDI profile type: Publication
cites work: Bounded Round Interactive Proofs in Finite Groups
cites work: Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
cites work: Q4039803
cites work: Does co-NP have short interactive proofs ?
cites work: Q5848209
cites work: Q4273602
cites work: Self-witnessing polynomial-time complexity and prime factorization
cites work: Gap-definable counting classes
cites work: Q3253828
cites work: Group-theoretic algorithms and graph isomorphism
cites work: Graph isomorphism is low for PP
cites work: A note on the graph isomorphism counting problem
cites work: Graph isomorphism is in the low hierarchy
cites work: PP is as Hard as the Polynomial-Time Hierarchy
description: scientific article; zbMATH DE number 1493358