The multiplicative complexity of interval checking
Thomas Häner, Mathias Soeken · arXiv (Cornell University) · 2022
We determine the exact AND-gate cost of checking if $a\leq x < b$, where $a$ and $b$ are constant integers. Perhaps surprisingly, we find that the cost of interval checking never exceeds that of a single comparison and, in some cases, it is even lower.