{"title":"探索次加性方法的极限:优化与复杂性理论的相似之处","authors":"Kenya Ueno","doi":"10.4036/IIS.2015.L.03","DOIUrl":null,"url":null,"abstract":"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.","PeriodicalId":91087,"journal":{"name":"Interdisciplinary information sciences","volume":"21 1","pages":"329-349"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.4036/IIS.2015.L.03","citationCount":"0","resultStr":"{\"title\":\"Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory\",\"authors\":\"Kenya Ueno\",\"doi\":\"10.4036/IIS.2015.L.03\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"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.\",\"PeriodicalId\":91087,\"journal\":{\"name\":\"Interdisciplinary information sciences\",\"volume\":\"21 1\",\"pages\":\"329-349\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-04-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.4036/IIS.2015.L.03\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Interdisciplinary information sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4036/IIS.2015.L.03\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Interdisciplinary information sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4036/IIS.2015.L.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
