4 papers
The Complexity of Satisfiability Checking for Symbolic Finite Automata
Rodrigo Raya
We study the satisfiability problem of symbolic finite automata and decompose it into the satisfiability problem of the theory of the input characters and the monadic second-order…
NP Decision Procedure for Monomial and Linear Integer Constraints
Rodrigo Raya, Jad Hamza, Viktor Kunčak
Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a li…
NP Satisfiability for Arrays as Powers
Rodrigo Raya, Viktor Kunčak
We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is in NP. As an application, we extend the combinator…
Formal Proof of the Group Law for Edwards Elliptic Curves
Thomas Hales, Rodrigo Raya
This article gives an elementary computational proof of the group law for Edwards elliptic curves. The associative law is expressed as a polynomial identity over the integers that…