The multiplicative complexity of interval checking

01/25/2022
by   Thomas Häner, et al.
0

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

page 1

page 2

page 3

page 4

research
04/20/2020

On preconditioning and solving an extended class of interval parametric linear systems

We deal with interval parametric systems of linear equations and the goa...
research
09/07/2017

On the Complexity of ATL and ATL* Module Checking

Module checking has been introduced in late 1990s to verify open systems...
research
03/07/2020

Module checking of pushdown multi-agent systems

In this paper, we investigate the module-checking problem of pushdown mu...
research
01/31/2016

Reliability of Checking an Answer Given by a Mathematical Expression in Interactive Learning Systems

In this article we address the problem of automatic answer checking in i...
research
04/19/2017

Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

We consider a symmetric matrix, the entries of which depend linearly on ...
research
09/01/2022

Bribery Can Get Harder in Structured Multiwinner Approval Election

We study the complexity of bribery in the context of structured multiwin...
research
06/06/2023

Computing all monomials of degree n-1 using 2n-3 AND gates

We consider the vector-valued Boolean function f:{0,1}^n→{0,1}^n that ou...

Please sign up or login with your details

Forgot password? Click here to reset