A Note on an Upper-Bound for the Sum of a Class K and an Extended Class K Function
Adrian Wiltz, Dimos V. Dimarogonas

TL;DR
This paper derives a novel upper-bound for the sum of a class K and an extended class K function, providing new theoretical insights in the field.
Contribution
It introduces a previously unestablished upper-bound relation for the sum of class K and extended class K functions.
Findings
Derived an upper-bound for the sum of class K and extended class K functions.
Established that these relations are novel and not previously documented.
Provides theoretical foundation for future research in comparison functions.
Abstract
In this short note, we derive an upper-bound for the sum of two comparison functions, namely for the sum of a class K and an extended class K function. To the best of our knowledge, the relations derived in this note have not been previously derived in the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Approximation and Integration · Coding theory and cryptography · Cryptography and Residue Arithmetic
