computationally hard or not (algorithm question)
Many of your questions may have already been answered in earlier discussions or in the FAQ. The search results page will indicate current discussions as well as past list serves, articles, and papers.
Frank Joerdens frank at joerdens.deSat Mar 24 08:45:24 PST 2001
- Previous message: computationally hard or not (algorithm question)
- Next message: OT: computationally hard or not (algorithm question)
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
On Fri, Mar 23, 2001 at 01:19:01PM -0800, Adam Getchell wrote:
> Hi Frank,
>
> I'm not an expert or anything, but I happen to have "Introduction to
> Algorithms" by Thomas Cormen, Charles Leiserson, and Ronald Rivest ("CLR"
> for short) and Chapter 35, Computational Geometry, might have what you're
> looking for.
Got that too :), this is where I found the 2D shortest-pair algorithm I
mentioned.
Thanks, Frank
- Previous message: computationally hard or not (algorithm question)
- Next message: OT: computationally hard or not (algorithm question)
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
More information about the Beowulf mailing list