Phase transition in the assignment problem for random matrices

Simple item page
dc.creatorEsteve, J. G.
dc.creatorFalceto, F.
dc.date2005-11-30
dc.date.accessioned2026-07-07T06:49:39Z
dc.date.available2026-07-07T06:49:39Z
dc.descriptionWe report an analytic and numerical study of a phase transition in a P problem (the assignment problem) that separates two phases whose representatives are the simple matching problem (an easy P problem) and the traveling salesman problem (a NP-complete problem). Like other phase transitions found in combinatoric problems (K-satisfiability, number partitioning) this can help to understand the nature of the difficulties in solving NP problems an to find more accurate algorithms for them.
dc.description7 pages, 5 figures; accepted for publication in Europhys. Lett. http://www.edpsciences.org/journal/index.cfm?edpsname=epl
dc.identifierhttps://arxiv.org/abs/cs/0511107
dc.identifierhttp://arxiv.org/abs/cs/0511107
dc.identifierdoi:10.1209/epl/i2005-10296-6
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/104428
dc.subjectComputational Complexity
dc.subjectStatistical Mechanics
dc.titlePhase transition in the assignment problem for random matrices
dc.typetext

Files

Collections

arXiv