Subpolynomial complexity classes of real functions and real numbers

Authors:
N T Müller
Affiliations:
-
Venue:
International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Year:
1986

Citing 0
Cited 2

Using PVS to validate the algorithms of an exact arithmetic

Theoretical Computer Science - Real numbers and computers
A Survey of Exact Arithmetic Implementations

CCA '00 Selected Papers from the 4th International Workshop on Computability and Complexity in Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract