Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Algorithmic number theory
SIAM Journal on Computing
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Exact and Approximate Testing/Correcting of Algebraic Functions: A Survey
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
The query complexity of order-finding
Information and Computation
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Non-Abelian homomorphism testing, and distributions close to their self-convolutions
Random Structures & Algorithms
Derandomizing Homomorphism Testing in General Groups
SIAM Journal on Computing
On The Complexity Of Matrix Group Problems I
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Quantum Property Testing of Group Solvability
Algorithmica - Special Issue: Latin American Theoretical Informatics
Decomposing finite Abelian groups
Quantum Information & Computation
On the distance between non-isomorphic groups
European Journal of Combinatorics
| Hi-index | 0.00 |
This paper studies the problem of testing if an input (Γ,驴), where Γ is a finite set of unknown size and 驴 is a binary operation over Γ given as an oracle, is close to a specified class of groups. Friedl et al. (Proc. of STOC, 2005) have constructed an efficient tester using poly(log|Γ|) queries for the class of abelian groups. We focus in this paper on subclasses of abelian groups, and show that these problems are much harder: Ω(|Γ|1/6) queries are necessary to test if the input is close to a cyclic group, and Ω(|Γ| c ) queries for some constant c are necessary to test more generally if the input is close to an abelian group generated by k elements, for any fixed integer k驴1. We also show that knowledge of the size of the ground set Γ helps only for k=1, in which case we construct an efficient tester using poly(log|Γ|) queries; for any other value k驴2 the query complexity remains Ω(|Γ| c ). All our upper and lower bounds hold for both the edit distance and the Hamming distance. These are, to the best of our knowledge, the first nontrivial lower bounds for such group-theoretic problems in the property testing model and, in particular, they imply the first exponential separations between the classical and quantum query complexities of testing closeness to classes of groups.