On the number of relational operators necessary to compute certain functions of real variables

DOI10.1007/BF00265560zbMath0489.68037MaRDI QIDQ1166929

S. Singh

Publication date: 1983

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

sorting algorithmlower bounds for computations of functionsmax function of n argumentsreal number operationsrelational operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10)

Related Items (2)

Constructing sets of functions which have a givenF-cardinality ⋮ On the complexity of convex hull algorithms if rotational minima can be found very fast

This page was built for publication: On the number of relational operators necessary to compute certain functions of real variables