Author： Magniez Frederic Nayak Ashwin
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.48, Iss.3, 2007-07, pp. : 221-232
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Quantum Property Testing of Group Solvability
By Inui Yoshifumi Gall François
Algorithmica, Vol. 59, Iss. 1, 2011-01 ,pp. :
Access to resources
Recommend
Quantum communication and complexity
By de Wolf R.
Theoretical Computer Science, Vol. 287, Iss. 1, 2002-09 ,pp. :
The counting complexity of group-definable languages
By Arvind V. Vinodchandran N.V.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :