This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Need graph coloring code
On 23-Jan-2001, Daniel Berlin <dberlin@redhat.com> wrote:
>
>
> On Tue, 23 Jan 2001, Andy Walker wrote:
>
> > Um ... I don't read the statutes and case law that way. In fact, I read it
> > exactly the opposite way: substantial improvements of the original algorithm
> > are specifically covered by the original patent.
>
> No, they aren't.
> Look at other patents, like Rice's patent on brigg's optimistic
> coalescing.
> It's essentially the same, with slightly different heuristic.
The fact that somone can obtain a new patent on an improved algorithm
does not necessarily mean that the improved algorithm is not covered
by the original patent. As I understand it, in order to use the
improved algorithm, you may need to license *both* patents.
--
Fergus Henderson <fjh@cs.mu.oz.au> | "I have always known that the pursuit
| of excellence is a lethal habit"
WWW: <http://www.cs.mu.oz.au/~fjh> | -- the last words of T. S. Garp.