Martin Jonás

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper, we prove the precise computational complexity of deciding satisfiability of first-order quantified formulas over the theory of fixed-size bit-vectors. This problem is known to be solvable in exponential space and to be NEXPTIME-hard. We show that this problem is complete for the complexity class AEXP(poly) – the class of problems decidable by(More)
  • 1