In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Potts and Edalat [1]. We choose the constructive type theory as our formal verification t...
In this work we focus on a formalisation of the algorithms of lazy exact arithmetic `a la Edalat–Potts in type theory. We choose the constructive type theory extended with coind...
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
Abstract. Fast algorithms for arithmetic on real or complex polynomials are wellknown and have proven to be not only asymptotically efficient but also very practical. Based on Fas...
—Binary robotic devices with large degrees of freedom have been proposed by a number of researchers. However, experimental implementations of these concepts have been built with ...
Moustapha Hafez, Matthew D. Lichter, Steven Dubows...