8 citations · 16 across the 4 of their papers we have counts for
Showing math.NAShow all
2 papers · 1 filter
math.NA2016★ 4 cited
Semantics, Specification Logic, and Hoare Logic of Exact Real Computation
Sewon Park, Franz Brauße, Pieter Collins +7
We propose a simple imperative programming language, ERC, that features arbitrary real numbers as primitive data type, exactly. Equipped with a denotational semantics, ERC provides…
math.NA2012★ 8 cited
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime
Akitoshi Kawamura, Norbert Th. Müller, Carsten Rösnick +1
The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, inte…