On the Correlation Between Parity and Modular Polynomials

DOI10.1007/11821069_34zbMath1132.68423OpenAlexW1928232725MaRDI QIDQ5756672

Vladimir Trifonov, Anna Gál

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

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

Related Items (1)

Uniqueness of optimal mod 3 polynomials for parity

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