 | 1986 |
|---|
| 5 |       | Mirko Krivánek,
Jaroslav Morávek:
NP -Hard Problems in Hierarchical-Tree Clustering.
Acta Inf. 23(3): 311-323 (1986) |
| 1985 |
|---|
| 4 | | Mirko Krivánek,
Jaroslav Morávek:
Clustering to minimize the sum of volumes of convex hulls of clusters is NP-complete.
FCT 1985: 234-241 |
| 3 | | Mirko Krivánek,
Jaroslav Morávek:
Linear comparison complexity of the n-cube membership problem.
FCT 1985: 242-248 |
| 1984 |
|---|
| 2 | | Jaroslav Morávek,
Pavel Pudlák:
New Lower Bound for Polyhedral Membership Problem with an Application to Linear Programming.
MFCS 1984: 416-424 |
| 1973 |
|---|
| 1 |  | Jaroslav Morávek:
Computational Optimality of a Dynamic Programming Method.
MFCS 1973: 267-270 |
Data released under the ODC-BY 1.0 license — See also our legal information page