Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms
Leighton, T
Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms T. Leighton; P. Shor - Berkeley Mathematical Sciences Research Institute 1986 - 27 p 29 cm
Contine bibliografie
Tight bounds for minimax grid matching, with applications to the average case analysis of algorithms T. Leighton; P. Shor - Berkeley Mathematical Sciences Research Institute 1986 - 27 p 29 cm
Contine bibliografie