Solution of the Linear Ordering Problem (NP=P)
Computational Complexity
2007-05-23 v1 Discrete Mathematics
Abstract
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
Cite
@article{arxiv.cs/0303008,
title = {Solution of the Linear Ordering Problem (NP=P)},
author = {Givi Bolotashvili},
journal= {arXiv preprint arXiv:cs/0303008},
year = {2007}
}