论文标题
间隔检查的乘法复杂性
The multiplicative complexity of interval checking
论文作者
论文摘要
我们确定检查$ a \ leq x <b $的确切和门口成本，其中$ a $和$ b $是恒定的整数。也许令人惊讶的是，我们发现间隔检查的成本永远不会超过单个比较的成本，在某些情况下，它甚至更低。
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.
