Google Groups Home
Help | Sign in
Message from discussion The FASTEST subsets function [Was: Subsets of a list]
The group you are posting to is a Usenet group. Messages posted to this group will make your email address visible to anyone on the Internet.
Your reply message has not been sent.
Your post was successful
Bradley J Lucier  
View profile
 More options Jan 12 2002, 6:16 pm
Newsgroups: comp.lang.scheme
From: b...@cs.purdue.edu (Bradley J Lucier)
Date: 12 Jan 2002 18:15:07 -0500
Local: Sat, Jan 12 2002 6:15 pm
Subject: Re: The FASTEST subsets function [Was: Subsets of a list]
In article <7eb8ac3e.0201120056.3fc23...@posting.google.com>,

o...@pobox.com <o...@pobox.com> wrote:
>The conclusion of this Friday night exercise is astonishingly trite.
>What a Math teacher told us is true: we have to attack the algorithm
>if we want to really big improvements. And Math rules!

John Rice at Purdue likes to say that in the past forty years algorithmic
improvements (FFT, multigrid, fast multipole methods, ...) have accounted
for more of the speedup in scientific computing than improvements in
hardware.

And he's right.

Brad Lucier


    Reply to author    Forward  
You must Sign in before you can post messages.
To post a message you must first join this group.
Please update your nickname on the subscription settings page before posting.
You do not have the permission required to post.

Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2008 Google