Feasible Real Functions and Arithmetic Circuits
- 1 February 1990
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 19 (1) , 182-204
- https://doi.org/10.1137/0219012
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the Complexity of Familiar Functions and NumbersSIAM Review, 1988
- Feasible arithmetic computations: Valiant's hypothesisJournal of Symbolic Computation, 1987
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986
- The computational complexity of maximization and integrationAdvances in Mathematics, 1984
- Computational complexity of real functionsTheoretical Computer Science, 1982
- Fast parallel matrix and GCD computationsInformation and Control, 1982
- On Relating Time and Space to Size and DepthSIAM Journal on Computing, 1977
- On the Definition of Computable Function of a Real VariableMathematical Logic Quarterly, 1976
- Rational approximation to $| x| $.The Michigan Mathematical Journal, 1964
- On the definitions of computable real continuous functionsFundamenta Mathematicae, 1957