Sciweavers

ITA
2007
14 years 11 days ago
Correct rounding of algebraic functions
We explicit the link between the computer arithmetic problem of providing correctly rounded algebraic functions and some diophantine approximation issues. This allows to get bounds...
Nicolas Brisebarre, Jean-Michel Muller
ITA
2007
14 years 11 days ago
Three notes on the complexity of model checking fixpoint logic with chop
Abstract. This paper analyses the complexity of model checking Fixpoint Logic with Chop – an extension of the modal µ-calculus with a sequential composition operator. It uses tw...
Martin Lange