Solution of the Linear Ordering Problem (NP=P)

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

A polynomial algorithm is obtained for the NP-complete linear ordering problem.

Keywords

Computational Complexity, Discrete Mathematics, F.2.0

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/31487

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0303008
 http://arxiv.org/abs/cs/0303008

Collections

arXiv