Derandomizing Homomorphism Testing in General Groups

DOI10.1137/S009753970444658XMaRDI QIDQ5757462zbMATH OpenOpenAlexFDO

Authors Amir Shpilka, A. Wigderson

Publication date 7 September 2007

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s009753970444658x

zbMATH Keywords

derandomizationhomomorphism testinglinearity testing

Mathematics Subject Classification ID

Theory of computing (68Q99)

Recommendations

• Derandomizing homomorphism testing in general groups
• On the derandomization of the graph test for homomorphism over groups
• Derandomizing Graph Tests for Homomorphism
• Local Decoding and Testing for Homomorphisms
• Efficient testing of groups

Cited in

(14)

• Algorithmic testing for dense orbits of Borel subgroups
• On the derandomization of the graph test for homomorphism over groups
• Testing properties of functions on finite groups
• Derandomizing the Ahlswede-Winter matrix-valued Chernoff bound using pessimistic estimators, and applications
• Derandomizing Graph Tests for Homomorphism
• Breaking the ε-Soundness Bound of the Linearity Test over GF(2)
• Derandomizing homomorphism testing in general groups
• List-decoding homomorphism codes with arbitrary codomains
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Non‐Abelian homomorphism testing, and distributions close to their self‐convolutions
• Optimal explicit small-depth formulas for the coin problem
• Property testing with online adversaries
• Property testing with online adversaries
• Direct sum and partitionability testing over general groups

This page was built for publication: Derandomizing Homomorphism Testing in General Groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5757462)