From: Boaz Chow
Subject: Master Theory
Date: Thu, 04 Apr 1996 00:00:00 +0000
Message-ID: <4jv7rb$oga@news1.h1.usa.pipeline.com>

What the heck is Master Theory? 
-- 
   ______   Meow 
   \ OO /  _/  
  :(__ =) 
    U \\ 
http://www.sci.csupomona.edu/~cchow

From: Marty Hall
Subject: Re: Master Theory
Date: Thu, 04 Apr 1996 00:00:00 +0000
Message-ID: <DpCB0C.3HE@aplcenmp.apl.jhu.edu>

In article <··········@news1.h1.usa.pipeline.com>
····@usa.pipeline.com(Boaz Chow) writes: 
>What the heck is Master Theory? 

Since your last question had to do with asymptotic notation for
measuring the growth of algorithms, I would guess you mean the "Master
Theorem", which gives an easy method for solving recurrences that are 
of a certain common form. See a text on algorithms for more details.

BTW, general questions like this and the previous one on big-oh
notation don't really belong in comp.lang.lisp, but rather in some
more general CS forum.

I'm posting since mail bounced.
						- Marty
(proclaim '(inline skates))
http://www.apl.jhu.edu/~hall/lisp.html