Derandomizing homomorphism testing in general groups
From MaRDI portal
Publication:3580987
DOI10.1145/1007352.1007421zbMath1192.68378OpenAlexW2022424731MaRDI QIDQ3580987
Publication date: 15 August 2010
Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1007352.1007421
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to group theory (20-04) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items (6)
A self-tester for linear functions over the integers with an elementary proof of correctness ⋮ Quantum property testing of group solvability ⋮ On the derandomization of the graph test for homomorphism over groups ⋮ Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions ⋮ Unnamed Item ⋮ Direct Sum Testing
This page was built for publication: Derandomizing homomorphism testing in general groups
