Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!zaphod.mps.ohio-state.edu!wuarchive!ukma!hsdndev!cmcl2!lanl!cochiti.lanl.gov!jlg
From: jlg@cochiti.lanl.gov (Jim Giles)
Newsgroups: comp.lang.fortran
Subject: Re: why does optimization take so long ?
Message-ID: <24206@lanl.gov>
Date: 22 May 91 14:41:15 GMT
References: <1236@nikhefh.nikhef.nl> <24940@well.sf.ca.us> <24204@lanl.gov>
Sender: news@lanl.gov
Organization: Los Alamos National Laboratory
Lines: 11

In article <24204@lanl.gov>, jlg@cochiti.lanl.gov (Jim Giles) writes:
|> [...]
|> Consider (A*B*C + A*D*C + B*C*D): common expressions are A*C, B*C, A*D,
|> and C*D.  [...]                                                    ^^^
                                                                       |
_______________________________________________________________________|

That of course is an error.  I don't know why I wrote that.  The rest
of the discussion is right.

J. Giles