The parallel complexity of positive linear programming

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/114140

Title:	The parallel complexity of positive linear programming
Author:	Trevisan, Luca; Xhafa Xhafa, Fatos
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Abstract:	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.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Linear programming -Parallel programming (Computer science) -Computational complexity -Parallel complexity -Fractional packing/covering linear programs -Logspace reduction -Programació lineal -Programació en paral·lel (Informàtica) -Complexitat computacional
Rights:
Document type:	Article - Submitted version Article
Share: