Author:
Hebbinghaus Nils,Srivastav Anand
Publisher
Springer International Publishing
Reference76 articles.
1. N. Alon, J.H. Spencer, P. Erdős, The Probabilistic Method (Wiley, New York, 1992)
2. K. Appel, W. Haken, Every planar map is four colorable. I: Discharging. Ill. J. Math. 21, 429–490 (1977)
3. K. Appel, W. Haken, J. Koch, Every planar map is four colorable. II: Reducibility. Ill. J. Math. 21, 491–567 (1977)
4. L. Babai, T.P. Hayes, P.G. Kimmel, The cost of the missing bit: Communication complexity with help, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, Texas, USA, May 1998 (STOC 1998), 1998, pp. 673–682
5. W. Banaszczyk, Balancing vectors and Gaussian measures of n-dimensional convex bodies. Random Struct. Algorithm 12(4), 351–360 (1998)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献