summary:Using counterexample it has been shown that an algorithm which is minimax optimal and over all minimax optimal algorithms is minimean optimal and has a uniform behaviour need not to be minimean optimal
AbstractMoser asks how a pair of (n+1)-sided dice should be loaded (identically) so that on throwing...
In this paper we deal with the problem of finding the smallest and the largest elements of a totally...
textabstractIn this paper we review known minimax results with applications in game theory and show ...
summary:Using counterexample it has been shown that an algorithm which is minimax optimal and over a...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
AbstractWe show that the least number principle for Σˆkb (strict Σkb) formulas can be characterized ...
This paper shows that finding the row minima (maxima) in an $n \times n$ totally monotone matrix in ...
We present here classical minimax inequalities as well as more recent ones, as the Ky Fan inequality...
We initiate a study of algorithms with a focus on the computational complexity of individual element...
Abstract: Recurrence relations with minimization and maxi-mization, called minmax recurrence relatio...
A tournament T=(V,A) is called cycle Mengerian (CM) if it satisfies the minimax relation on packing ...
We initiate a study of algorithms with a focus on the computational complexity of individual element...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
AbstractMoser asks how a pair of (n+1)-sided dice should be loaded (identically) so that on throwing...
In this paper we deal with the problem of finding the smallest and the largest elements of a totally...
textabstractIn this paper we review known minimax results with applications in game theory and show ...
summary:Using counterexample it has been shown that an algorithm which is minimax optimal and over a...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth min...
AbstractWe show that the least number principle for Σˆkb (strict Σkb) formulas can be characterized ...
This paper shows that finding the row minima (maxima) in an $n \times n$ totally monotone matrix in ...
We present here classical minimax inequalities as well as more recent ones, as the Ky Fan inequality...
We initiate a study of algorithms with a focus on the computational complexity of individual element...
Abstract: Recurrence relations with minimization and maxi-mization, called minmax recurrence relatio...
A tournament T=(V,A) is called cycle Mengerian (CM) if it satisfies the minimax relation on packing ...
We initiate a study of algorithms with a focus on the computational complexity of individual element...
This paper presents a new semantic method for proving lower bounds in computational complexity. We u...
We consider the problem of selecting the r -smallest element from a list of n elements under a mo...
AbstractMoser asks how a pair of (n+1)-sided dice should be loaded (identically) so that on throwing...
In this paper we deal with the problem of finding the smallest and the largest elements of a totally...
textabstractIn this paper we review known minimax results with applications in game theory and show ...
DOI
Add to ORKG