Convex and linear models of NPproblems
Abstract
Reducing the NPproblems to the convex/linear analysis on the Birkhoff polytope.
 Publication:

arXiv eprints
 Pub Date:
 November 2007
 arXiv:
 arXiv:0711.0086
 Bibcode:
 2007arXiv0711.0086G
 Keywords:

 Computer Science  Discrete Mathematics;
 Computer Science  Computational Complexity;
 Computer Science  Data Structures and Algorithms;
 Mathematics  Combinatorics;
 F.2.0;
 G.2.1;
 G.2.2
 EPrint:
 In part, the results were presented on WCECS 2007/ICCSA 2007. V2 edited