Růžička, Peter, and Wiedermann, Juraj. "On the conjecture relating minimax and minimean complexity norms." Aplikace matematiky 24.5 (1979): 321-325. <http://eudml.org/doc/15109>.
@article{Růžička1979,
abstract = {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.},
author = {Růžička, Peter, Wiedermann, Juraj},
journal = {Aplikace matematiky},
keywords = {minimax and minimean complexity; optimal algorithm; uniform complexity; minimax and minimean complexity; optimal algorithm; uniform complexity},
language = {eng},
number = {5},
pages = {321-325},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {On the conjecture relating minimax and minimean complexity norms},
url = {http://eudml.org/doc/15109},
volume = {24},
year = {1979},
}
TY - JOUR
AU - Růžička, Peter
AU - Wiedermann, Juraj
TI - On the conjecture relating minimax and minimean complexity norms
JO - Aplikace matematiky
PY - 1979
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 24
IS - 5
SP - 321
EP - 325
AB - 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.
LA - eng
KW - minimax and minimean complexity; optimal algorithm; uniform complexity; minimax and minimean complexity; optimal algorithm; uniform complexity
UR - http://eudml.org/doc/15109
ER -
