[Full text not available]
It is shown that the matching problem and the low autocorrlated binary string problem belong to the same universality class of value landscapes as the TSP and the graph bipartitioning problem
Europhys.Lett. 20: 479-482 (1992).
PACS. 02.50 - Probability Theory, stochastic processes, and statistics
PACS. 05.50 - Lattice theory and statistics; Ising problems.
Return to 1992 working papers list.