On the Correlation Between Parity and Modular Polynomials

DOI10.1007/11821069_34MaRDI QIDQ5756672zbMATH OpenOpenAlexFDO

Authors Anna Gál, Vladimir Trifonov

Publication date 5 September 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11821069_34

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• On the correlation between parity and modular polynomials
• The correlation between parity and quadratic polynomials mod \(3\)
• Parity of the coefficients of modular forms
• Parity of Fourier coefficients of modular forms
• Parity of the partition function and the modular discriminant
• On the evaluation of modular polynomials
• On the correlations of \(n^\alpha \bmod 1\)
• On the parity of poly-Euler numbers
• Some Aspects of the Modular Relation
• scientific article; zbMATH DE number 7116919

Cited in

(6)

• The correlation between parity and quadratic polynomials mod \(3\)
• Block-symmetric polynomials correlate with parity better than symmetric
• Real advantage
• Estimation of certain exponential sums arising in complexity theory
• On the correlation between parity and modular polynomials
• Uniqueness of optimal mod 3 polynomials for parity

This page was built for publication: On the Correlation Between Parity and Modular Polynomials

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