1 citations · 1 across the 2 of their papers we have counts for
Showing cs.LOShow all
2 papers · 1 filter
cs.LO2022
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…
cs.LO2014★ 1 cited
On the complexity of Linearizability
Jad Hamza
It was shown in Alur et al. [1] that the problem of verifying finite concurrent systems through Linearizability is in EXPSPACE. However, there was still a complexity gap between th…