We give a correspondence between two notions of complexity for real numbers and functions: poly-time computability according to Ko and a notion that arises naturally when one cons...
In this second part of our state-of-the-art overview on aggregation theory, based again on our recent monograph on aggregation functions, we focus on several construction methods ...
Michel Grabisch, Jean-Luc Marichal, Radko Mesiar, ...
We prove that the (non-intuitionistic) law of the double negation shift has a bounded functional interpretation with bar recursive functionals of finite type. As an application, we...
Collision resistant hash functions are an important basic tool for cryptographic applications such as digital signature schemes and integrity protection based on "fingerprinti...
Although ceteris paribus preference statements concisely represent one natural class of preferences over outcomes or goals, many applications of such preferences require numeric u...