Jaroslav Morávek

发表

Computational Optimality of a Dynamic Programming Method

Jaroslav Morávek, 1973, MFCS.

Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete

Mirko Krivánek, Jaroslav Morávek, 1985, FCT.

NP-hard problems in hierarchical-tree clustering

Mirko Krivánek, Jaroslav Morávek, J. Morávek, 1986, Acta Informatica.

Linear comparison complexity of the n-cube membership problem

Mirko Krivánek, Jaroslav Morávek, 1985, FCT.

A localization problem in geometry and complexity of discrete programming

Jaroslav Morávek, 1972, Kybernetika.

New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming

Pavel Pudlák, Jaroslav Morávek, J. Morávek, 1984, MFCS.

A geometrical method in combinatorial complexity

Jaroslav Morávek, 1981 .

A note upon minimal path problem

Jaroslav Morávek, J. Morávek, 1970 .