21st Annual IEEE Conference on Computational Complexity (CCC'06) On Modular Counting with Polynomials Prague, Czech Republic July 16-July 20 ISBN: 0-7695-2596-2
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CCC.2006.29
For any integers m and l, where m has r sufficiently large (depending on l) factors, that are powers of r distinct primes, we give a construction of a (symmetric) polynomial over Z_m of degree O(\sqrt n) that is a generalized representation (commonly also called weak representation) of the MODl function. We give a detailed study of the case when m has exactly two distinct prime factors, and classify the minimum possible degree for a symmetric representing polynomial.
Citation:
Kristoffer Arnsfelt Hansen, "On Modular Counting with Polynomials," ccc, pp.202-212, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||