Constructing sets of functions which have a givenF-cardinality

DOI10.1007/BF01368781MaRDI QIDQ3992018zbMATH OpenFDO

Authors Ulrich Huckenbeck

Publication date 28 June 1992

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

Full work available at URL https://doi.org/10.1007/BF01368781

zbMATH Keywords

abstract automaton without conditional jumpsbasic arithmetic operationslower boundworst-case complexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• scientific article; zbMATH DE number 3854417
• Complexity of representation-of-choice functions as compositions. Asymptotic estimates of complexity characteristics
• Weak cardinality theorems
• scientific article; zbMATH DE number 2155203
• scientific article; zbMATH DE number 4179292

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• On the complexity of convex hull algorithms if rotational minima can be found very fast
• On the number of relational operators necessary to compute certain functions of real variables

Cited in

(4)

• Constructing finite sets from their representation functions
• scientific article; zbMATH DE number 2053196 (Why is no real title available?)
• Weak cardinality theorems
• Construction of systems of sets related to the plurality functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992018)