OpenAlex ·
Upper and lower bounds on the OBDD-width of a special integer multiplication
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2608.30664
- Original
- Read it at the publisher
- Topics
Abstract
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 $Θ(2^{s_*(n)})$.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Computational Complexity
The $α$-Limit Problem: Convergence of a Linear Degenerate Interface Transmission Problem
Tight Maximin Share Guarantees of EFX and PMMS
Text-guided flow matching enables sample-efficient crystal structure generation
Parameter-Robust Subspace Correction with Multiple Semidefinite Penalties
Efficiently Estimating Optimal Hyperparameter Scaling Laws through Power-Law Entropy Search
Get the few papers worth your time in Computational Complexity every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.