Skip to content

Opening book details…

About this Computer Science article

Discrete Convexity and Polynomial Solvability in Minimum 0-Extension Problems by Hirai, Hiroshi is a Computer Science article available to read on EtoBox.

It is typically read by researchers, students, and practitioners in Computer Science.

Author
Hirai, Hiroshi
Publisher
Springer-Verlag; Springer Verlag; Springer Science and Business Media LLC; Springer Nature (ISSN 0025-5610)
Published
2014
Field
Computer Science (Physical Sciences)

More by Hirai, Hiroshi

Browse all works by Hirai, Hiroshi