The parallel complexity of positive linear programming

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...

ver descrição completa

Detalhes bibliográficos
Autores: Trevisan, Luca, Xhafa Xhafa, Fatos|||0000-0001-6569-5497
Tipo de documento: artigo
Data de publicação:1998
País:España
Recursos:Universitat Politècnica de Catalunya (UPC)
Repositório:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglês
OAI Identifier:oai:upcommons.upc.edu:2117/114140
Acesso em linha:https://hdl.handle.net/2117/114140
https://dx.doi.org/10.1142/S0129626498000511
Access Level:Acceso aberto
Palavra-chave: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
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_385811bc7dc863caf4ebe1f036442a6b
oai_identifier_str oai:upcommons.upc.edu:2117/114140
network_acronym_str ES
network_name_str España
repository_id_str
spelling The parallel complexity of positive linear programmingTrevisan, LucaXhafa Xhafa, Fatos|||0000-0001-6569-5497Linear programmingParallel programming (Computer science)Computational complexityParallel complexityFractional packing/covering linear programsLogspace reductionProgramació linealProgramació en paral·lel (Informàtica)Complexitat computacionalÀrees temàtiques de la UPC::Informàtica::Informàtica teòricaIn 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.Peer Reviewed19981998-12-0120182018-02-15journal articlehttp://purl.org/coar/resource_type/c_6501AMhttp://purl.org/coar/version/c_ab4af688f83e57aainfo:eu-repo/semantics/articleapplication/pdfhttps://hdl.handle.net/2117/114140https://dx.doi.org/10.1142/S0129626498000511reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/1141402026-05-27T15:37:01Z
dc.title.none.fl_str_mv The parallel complexity of positive linear programming
title The parallel complexity of positive linear programming
spellingShingle The parallel complexity of positive linear programming
Trevisan, Luca
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
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short The parallel complexity of positive linear programming
title_full The parallel complexity of positive linear programming
title_fullStr The parallel complexity of positive linear programming
title_full_unstemmed The parallel complexity of positive linear programming
title_sort The parallel complexity of positive linear programming
dc.creator.none.fl_str_mv Trevisan, Luca
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author Trevisan, Luca
author_facet Trevisan, Luca
Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author_role author
author2 Xhafa Xhafa, Fatos|||0000-0001-6569-5497
author2_role author
dc.subject.none.fl_str_mv 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
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic 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
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description 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.
publishDate 1998
dc.date.none.fl_str_mv 1998
1998-12-01
2018
2018-02-15
dc.type.none.fl_str_mv journal article
http://purl.org/coar/resource_type/c_6501
AM
http://purl.org/coar/version/c_ab4af688f83e57aa
dc.type.openaire.fl_str_mv info:eu-repo/semantics/article
format article
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/114140
https://dx.doi.org/10.1142/S0129626498000511
url https://hdl.handle.net/2117/114140
https://dx.doi.org/10.1142/S0129626498000511
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869406095825436672
score 15,300719

Registros relacionados