arXiv (All)
open access
Machine-Verifying Toom-Cook Multiplication with Integer Evaluation Points
We present a machine-verified proof of the correctness of Toom-Cook multiplication with generalized integer evaluation points. Toom-Cook is a class of fast multiplication algorithms parameterized by a triple $(k_x, k_y, \vec v)$ consisting of two positive integer split sizes $k_x, k_y$ and a vector
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Dichotomy for Cubic Bipartite Holant Problems with Complex Algebraic Weights#1118185
- A Dichotomy for Complex Boolean Holant with Binary Disequality#819682
- A Dichotomy for Complex Boolean Holant with Binary Disequality#809686
- Introduction to Complex Automata using Cook Algebra#110998
- New Complexity Classes in Locally Checkable Labeling for Local Computation Algorithms#361424
Record · ID 1013523
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive