Parallel complexity of positive linear programming

被引:0
|
作者
MIT Lab for Computer Science, Cambridge, United States [1 ]
机构
来源
Parallel Process Lett | / 4卷 / 527-533期
关键词
Computational complexity - Constraint theory - Linear programming - Matrix algebra - Problem solving - Vectors;
D O I
暂无
中图分类号
学科分类号
摘要
In this paper we study the parallel complexity of Positive Linear Programming (PLP), i.e. the special case of Linear Programming in packing/covering form where the input constraint matrix and constraint vector consist entirely of positive entries. We show that the problem of exactly solving PLP is P-complete.
引用
收藏
相关论文
共 50 条