Jump to content

Search results

  • perfect strategy for n×n chess requires time exponential in n", J. Combin. Theory Ser. A, 31 (2): 199–214, doi:10.1016/0097-3165(81)90016-9 John Tromp (2021)...
    13 KB (1,541 words) - 05:02, 31 July 2024
  • Komlós, János; Szemerédi, Endre (1980), "A note on Ramsey numbers", J. Combin. Theory Ser. A, 29 (3): 354–360, doi:10.1016/0097-3165(80)90030-8. Bohman, Tom;...
    62 KB (7,919 words) - 16:19, 31 July 2024
  • Thumbnail for Hadamard matrix
    regular tournaments are equivalent to skew Hadamard matrices". J. Combin. Theory Ser. A. 12 (3): 332–338. doi:10.1016/0097-3165(72)90098-2. Seberry Wallis...
    25 KB (3,078 words) - 00:15, 27 May 2024
  • Thumbnail for Computer chess
    perfect strategy for n×n chess requires time exponential in n", J. Combin. Theory Ser. A, 31 (2): 199–214, doi:10.1016/0097-3165(81)90016-9 "CoffeeHouse:...
    108 KB (13,447 words) - 20:40, 30 July 2024