Constructing sets of functions which have a givenF-cardinality

DOI10.1007/BF01368781zbMath0766.68062MaRDI QIDQ3992018

Ulrich Huckenbeck

Publication date: 28 June 1992

Published in: Mathematical Systems Theory (Search for Journal in Brave)

zbMATH Keywords

lower boundworst-case complexitybasic arithmetic operationsabstract automaton without conditional jumps

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Unnamed Item
• On the number of relational operators necessary to compute certain functions of real variables
• On the complexity of convex hull algorithms if rotational minima can be found very fast

This page was built for publication: Constructing sets of functions which have a givenF-cardinality