On the Parallel Complexity of Integer Programming.


https://doi.org/10.1145/72935.72948
@inproceedings{DBLP:conf/spaa/Deng89, author = {Xiaotie Deng}, editor = {Frank Thomson Leighton}, title = {On the Parallel Complexity of Integer Programming}, booktitle = {Proceedings of the {ACM} Symposium on Parallel Algorithms and Architectures, {SPAA} '89, Santa Fe, New Mexico, USA, June 18-21, 1989}, pages = {110--116}, publisher = {{ACM}}, year = {1989}, url = {https://doi.org/10.1145/72935.72948}, doi = {10.1145/72935.72948}, timestamp = {Fri, 27 Mar 2020 08:59:15 +0100}, biburl = {https://dblp.org/rec/conf/spaa/Deng89.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21