Convex and linear models of NP-problems
Discrete Mathematics
2007-11-04 v2 Computational Complexity
Data Structures and Algorithms
Combinatorics
Abstract
Reducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
Keywords
Cite
@article{arxiv.0711.0086,
title = {Convex and linear models of NP-problems},
author = {Sergey Gubin},
journal= {arXiv preprint arXiv:0711.0086},
year = {2007}
}
Comments
In part, the results were presented on WCECS 2007/ICCSA 2007. V2 edited