66 citations · 76 across the 11 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016★ 1 cited
On the complexity of bounded time and precision reachability for piecewise affine systems
Hugo Bazille, Olivier Bournez, Walid Gomaa +1
Reachability for piecewise affine systems is known to be undecidable, starting from dimension . In this paper we investigate the exact complexity of several decidable variants o…
cs.CC2009★ 4 cited
Characterizing Polynomial Time Computability of Rational and Real Functions
Walid Gomaa
Recursive analysis was introduced by A. Turing [1936], A. Grzegorczyk [1955], and D. Lacombe [1955]. It is based on a discrete mechanical framework that can be used to model comput…