3 search results - page 1 / 1 » The Polynomial Composition Problem in (Z nZ)[X] |
ICCAD
2008
IEEE
14 years 7 months ago
2008
IEEE
Abstract— This paper addresses the problem of solving finite word-length (bit-vector) arithmetic with applications to equivalence verification of arithmetic datapaths. Arithmet...
MCU
2007
14 years 9 days ago
2007
We review some results about the computational power of several computational models. Considered models have in common to be related to continuous dynamical systems. 1 Dynamical Sy...
TACAS
2007
Springer
14 years 5 months ago
2007
Springer
We study and provide efficient algorithms for multi-objective model checking problems for Markov Decision Processes (MDPs). Given an MDP, M, and given multiple linear-time (ω-regu...