zbMATH — the first resource for mathematics

A note on time-space tradeoffs for computing continuous functions. (English) Zbl 0412.68039

68Q25 Analysis of algorithms and problem complexity
26B05 Continuity and differentiation questions
26C10 Real polynomials: location of zeros
68P10 Searching and sorting
Full Text: DOI
[1] Tompa, M., Time-space tradeoffs for computing functions, using connectivity properties of their circuits, Tenth annual ACM symposium on theory of computing, (May, 1978), San Diego
[2] Valiant, L., Graph-theoretic arguments in computational complexity, J. comput. system sci., 13, 278-285, (1976) · Zbl 0354.68071
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.