The multiplicative complexity of interval checking
We determine the exact AND-gate cost of checking if a≤ 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.
READ FULL TEXT