The multiplicative complexity of interval checking

01/25/2022

∙

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

The multiplicative complexity of interval checking

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

On the Complexity of ATL and ATL* Module Checking

Module checking of pushdown multi-agent systems

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

Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

Bribery Can Get Harder in Structured Multiwinner Approval Election

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions

The multiplicative complexity of interval checking

Related Research

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

On the Complexity of ATL and ATL* Module Checking

Module checking of pushdown multi-agent systems

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

Positive Semidefiniteness and Positive Definiteness of a Linear Parametric Interval Matrix

Bribery Can Get Harder in Structured Multiwinner Approval Election

On the Complexity of Model Checking for Syntactically Maximal Fragments of the Interval Temporal Logic HS with Regular Expressions