Convex and linear models of NP-problems

Simple item page
dc.creatorGubin, Sergey
dc.date2007-11-01
dc.date2007-11-04
dc.date.accessioned2026-07-07T08:39:59Z
dc.date.available2026-07-07T08:39:59Z
dc.descriptionReducing the NP-problems to the convex/linear analysis on the Birkhoff polytope.
dc.descriptionIn part, the results were presented on WCECS 2007/ICCSA 2007. V2 edited
dc.identifierhttps://arxiv.org/abs/0711.0086
dc.identifierhttp://arxiv.org/abs/0711.0086
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/141265
dc.subjectDiscrete Mathematics
dc.subjectComputational Complexity
dc.subjectData Structures and Algorithms
dc.subjectCombinatorics
dc.subjectF.2.0; G.2.1; G.2.2
dc.titleConvex and linear models of NP-problems
dc.typetext

Files

Collections

arXiv