Interdisciplinary Information Sciences
Online ISSN : 1347-6157
Print ISSN : 1340-9050
ISSN-L : 1340-9050
Reviews and Lectures: Exploring the Limits of Computation II
Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory
Kenya UENO
著者情報
ジャーナル フリー

2015 年 21 巻 4 号 p. 329-349

詳細
抄録
In this paper, we review subadditive approaches which arise in the theory of mathematical programming and computational complexity. In particular, we explain the duality theorem of integer programming and techniques to prove formula-size lower bounds as fundamental subjects in mathematical programming and computational complexity, respectively. We discuss parallel visions of these two different areas by showing some connections between them.
著者関連情報
© 2015 by the Graduate School of Information Sciences (GSIS), Tohoku University

This article is licensed under a Creative Commons [Attribution 4.0 International] license.
https://creativecommons.org/licenses/by/4.0/
前の記事 次の記事
feedback
Top