Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Hello from Edmonton (and on Temporal Differences)

Author: Dan Andersson

Date: 15:45:14 08/06/02

Go up one level in this thread


If you mean that solving a linear equation system involves a matrix inversion.
Then the complexity is less than o(n^3) It is possible to do in O(n^log2(7)).
But you might refer to something else.

MvH Dan Andersson



This page took 0 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.