@article {IOPORT.05657359,
    author       = {B\u a\c t, Ion},
    title        = {Minimum convex partitions of multidimensional polyhedrons.},
    year         = {2007},
    journal      = {Computer Science Journal of Moldova},
    volume       = {15},
    number       = {3},
    issn         = {1561-4042},
    pages        = {288-302},
    publisher    = {Academy of Science of Moldova, Institute of Mathematics and Computer Science, Kishinev},
    abstract     = {Summary: In a normed space ${\cal R}^n$ over the field of real numbers $\Bbb R$, which is an $\alpha$-space, we derive a formula expressing the minimum number of $d$-convex pieces into which a geometric $n$-dimensional polyhedron can be partitioned. The mentioned problem remained unsolved for more than 30 years. The special cases for ${\cal R}^2$, ${\cal R}^3$ lead to nontrivial applications.},
    identifier   = {05657359},
}