The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Page 1

Displaying 1 – 5 of 5

Showing per page

On the conjecture relating minimax and minimean complexity norms

Peter Růžička, Juraj Wiedermann (1979)

Aplikace matematiky

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.

Currently displaying 1 – 5 of 5

Page 1