Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!elroy.jpl.nasa.gov!ncar!news.miami.edu!mthvax!paris!janplaza
From: janplaza@paris.CS.Miami.EDU (Jan Plaza)
Newsgroups: comp.theory
Subject: Monographs on Complexity
Summary: Could you recommend any monographs (broader than textbooks)
Keywords: Theory of Computational Complexity, Complexity of Parallel Algorithms
Message-ID: <1991May02.223636.24759@mthvax.cs.miami.edu>
Date: 2 May 91 22:36:36 GMT
Reply-To: plaza@math.miami.edu
Distribution: na
Organization: University of Miami Department of Mathematics & Computer Science
Lines: 14

Hi,
there is of course excellent book 
      Computers and Intractability by Garey and Johnson.
Could you recommend any other monographs (broader than textbooks), or good
expository papers on the Theory of Computational Complexity. Is there
anything on complexity of parallel algorithms.
Thanks a lot,
Jan

--
***************************************************************
 Dr. Jan A. Plaza                       (305) 284 2575 (office)
 University of Miami                    (305) 284 2840 (fax)
 Mathematics and Computer Science       plaza@math.miami.edu