Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: A final stab at big-O

Author: Dann Corbit

Date: 14:40:16 05/09/01

On May 09, 2001 at 17:32:27, Ricardo Gibert wrote:
[snip]
References: A. S. Fraenkel and D. Lichtenstein, Computing a perfect strategy for
n*n chess requires time exponential in n, Proc. 8th Int. Coll. Automata,
Languages, and Programming, Springer LNCS 115 (1981) 278-293 and J. Comb. Th. A
31 (1981) 199-214.

FCOL

Re: A final stab at big-O Ricardo Gibert 16:27:51 05/09/01
- Re: A final stab at big-O Dann Corbit 16:31:23 05/09/01
  - Re: A final stab at big-O Ricardo Gibert 16:34:35 05/09/01
    - Re: A final stab at big-O Dann Corbit 16:36:18 05/09/01
      - Re: A final stab at big-O Ricardo Gibert 17:14:41 05/09/01
        
        Re: A final stab at big-O José Carlos 09:00:54 05/10/01
        
        Re: A final stab at big-O Robert Hyatt 19:41:41 05/09/01
        
        Re: A final stab at big-O Dann Corbit 17:23:27 05/09/01
        
        Re: A final stab at big-O Ricardo Gibert 18:24:01 05/09/01
Re: A final stab at big-O Ricardo Gibert 15:20:59 05/09/01
- Re: A final stab at big-O Dann Corbit 15:28:21 05/09/01
  - Re: A final stab at big-O Ricardo Gibert 17:07:29 05/09/01
    - Re: A final stab at big-O Dann Corbit 17:18:09 05/09/01
Re: A final stab at big-O Uri Blass 15:06:36 05/09/01
- Re: A final stab at big-O Dann Corbit 15:09:38 05/09/01
  - Re: A final stab at big-O Antonio Dieguez 09:08:21 05/10/01

This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.