Affiliation:
1. Graduate School of Informatics, Kyoto University
Publisher
Institute of Electronics, Information and Communications Engineers (IEICE)
Subject
Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing
Reference12 articles.
1. The complexity of the Pigeonhole Principle
2. [2] P.W. Beame, R. Impagiazzo, J. Krajícek, T. Pitassi, P. Pudlák, and A. Woods, “Exponential lower bounds for the pigeonhole principle,” Proc. STOC 1992, pp.200-220, 1992.
3. [3] R.L. Brooks, “On colouring the nodes of a network,” Proc. Cambridge Phil. Soc., vol.37, pp.194-197, 1941.
4. [4] M.R. Garey, D.S. Johnson, and L.J. Stockmeyer, “Some simplified NP-complete graph problems,” Theor. Comput. Sci., vol.1, no.3, pp.237-267, 1976.
5. [5] H. Grötzsch, “Ein Dreifarbensatz für dreikreisfreie Netze auf der kugel,” Wiss. Z. Martin Luther Univ. Halle-Wittenberg, Math. Nat. Reihe, vol.8, pp.109-120, 1959.