Solution of the Linear Ordering Problem (NP=P)

Simple item page
dc.creatorBolotashvili, Givi
dc.date2003-03-14
dc.date.accessioned2026-07-07T03:19:30Z
dc.date.available2026-07-07T03:19:30Z
dc.descriptionA polynomial algorithm is obtained for the NP-complete linear ordering problem.
dc.identifierhttps://arxiv.org/abs/cs/0303008
dc.identifierhttp://arxiv.org/abs/cs/0303008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31487
dc.subjectComputational Complexity
dc.subjectDiscrete Mathematics
dc.subjectF.2.0
dc.titleSolution of the Linear Ordering Problem (NP=P)
dc.typetext

Files

Collections

arXiv