Newsgroups: comp.lang.lisp,
Path: cantaloupe.srv.cs.cmu.edu!bb3.andrew.cmu.edu!newsfeed.pitt.edu!gatech!newsfeed.internetmci.com!in1.uu.net!explorer.csc.com!aplcenmp!hall
From: hall@aplcenmp.apl.jhu.edu (Marty Hall)
Subject: Re: Master Theory
Message-ID: <DpCB0C.3HE@aplcenmp.apl.jhu.edu>
Organization: JHU/APL Research Center, Hopkins P/T CS Faculty
References: <4jv7rb$oga@news1.h1.usa.pipeline.com>
Date: Thu, 4 Apr 1996 13:33:47 GMT
Lines: 17

In article <4jv7rb$oga@news1.h1.usa.pipeline.com>
boaz@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
