Metraipolis › archive › dc_c6eed123df2c

Upper and lower bounds on the OBDD-width of a special integer multiplication — arXiv:2608.30664

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30664
License (as archived)
CC0-1.0
Archived
2026-10-17T10:07:18.129Z
SHA-256 of the archived text
aea90abea86ebc48021de7cf676c9cc71002161a839bf3be140d2ce1ea821bc8
Stable URL of this page
https://metraipolis.com/documento/dc_c6eed123df2c

How to cite

Upper and lower bounds on the OBDD-width of a special integer multiplication — arXiv:2608.30664 — arXiv (en), https://arxiv.org/abs/2608.30664 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c6eed123df2c (Metraipolis archive dc_c6eed123df2c, sha256 aea90abea86ebc48021de7cf676c9cc71002161a839bf3be140d2ce1ea821bc8)
BibTeX
@misc{dcc6eed123df2c,
  title = {Upper and lower bounds on the OBDD-width of a special integer multiplication — arXiv:2608.30664},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30664},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c6eed123df2c; sha256 aea90abea86ebc48021de7cf676c9cc71002161a839bf3be140d2ce1ea821bc8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30664. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 OBDDs computing ${\rm SMul}_{n-1}^n$. We introduce a combinatorially defined function $s_*(n)$ and show that the width of such OBDDs is $\Theta(2^{s_*(n)})$.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in cs.DS).
Categorie arXiv: Computational Complexity (cs.CC) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.30664 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:00:01.306Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).