274 search results - page 16 / 55 » corr 2004 |
CORR
2004
Springer
13 years 9 months ago
2004
Springer
CORR
2004
Springer
13 years 9 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
CORR
2004
Springer
13 years 9 months ago
2004
Springer
: The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Abstract
CORR
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Starting with a monodisperse configuration with n size