Conceptio › Archive › arXiv (All)
arXiv (All)open access

Unrestricted Boolean Multiplicative Complexity of Four-Term Binary Polynomial Multiplication: Rational Places, Hasse Jets, and the Failure of Nonlinear Feedback

Morse, Gregory
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexitydata-structures-and-algorithms
computational complexity, data structures and algorithms, 68q06 (primary) 68q17, 68w30, 15a75, 94d10 (secondary), f.1.3; f.2.1
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 799456
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.