arXiv (All)
open access
Upper and lower bounds on the OBDD-width of a special integer multiplication
We consider the Boolean function ${\rm SMul}_{n-1}^n(\boldsymbol{x},\boldsymbol{y})$, which computes the middle bit of the multiplication of two natural numbers represented as $n$-bit binary strings $\boldsymbol{x}$ and $\boldsymbol{y}$, drawn from a restricted domain. We investigate the width of OB
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
- Upper and lower bounds on the OBDD-width of a special integer multiplication#808728
- Upper Bounds on Efficiency of Pixel Antennas#1156042
- Maximal Kolmogorov Complexity in a Hamming Ball#998897
- Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs#927302
- GOST R 34.10-2012: Digital Signature Algorithm#398992
Record · ID 818720
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