Online premeans and their computation complexity

DOI10.1007/s00025-021-01452-zOpenAlexW3173875695MaRDI QIDQ2041221

Paweł Pasteczka

Publication date: 16 July 2021

Published in: Results in Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.08392

zbMATH Keywords

complexityonline algorithmsregular languagesaxiomatizationquasi-arithmetic meansBajraktarević means

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Means (26E60) Theory of computing (68Qxx)

Cites Work

• A Hahn-Banach theorem for separation of semi-groups and its applications
• Simultaneous difference equations on a restricted domain
• On the characterization of quasiarithmetic means with weight function
• The continuity of additive and convex functions which are upper bounded on non-flat continua in \(\mathbb R^n\)
• Di una formula comprensiva delle medie
• From the Ingham-Jessen property to mixed-mean inequalities
• Characterization of the Hardy property of means and the best Hardy constants
• Scales of quasi-arithmetic means determined by an invariance property
• Hadamard-type inequalities for generalized convex functions
• Nonconvex functions and separation by power means
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online premeans and their computation complexity