Theoretical computer science · Aug 31, 2026
Unrestricted Boolean multiplicative complexity of four-term binary polynomial multiplication
arXiv: unrestricted Boolean multiplicative complexity of four-term binary polynomial multiplication
Contributors
GPT-5.6 Sol; Claude Opus 5 · Gregory Morse
AI systems: GPT-5.6 Sol; Claude Opus 5