Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms

Frank Thomson Leighton, Peter W. Shor. Tight Bounds for Minimax Grid Matching, With Applications to the Average Case Analysis of Algorithms. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA. pages 91-103, ACM, 1986.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.