[ut.theory] Short Course in Circuit Complexity and Lower Bounds

nishi@theory.toronto.edu (Naomi Nishimura) (04/25/89)

The following is a reposting of an annoucement for a short course on circuit
complexity and lower bounds to be held in Chicago this summer.  The hope is
to fill a few cars with people and head down: Arvind is working on funding and
I am working on logistics.  If you are interested in attending (or better yet,
in helping Arvind or me get things rolling), please let me know.  I will post
further information as it becomes available.

Naomi

*******************************************************************************



                     Preliminary Announcement

                      NSF-CBMS Short Course 
                               on 

                 Circuit Complexity and Lower Bounds
            (Current Approaches to the P vs. NP Problem)

                  at the University of Chicago, 
                  August 28 - September 1, 1989. 
             
             Principal Lecturer: MICHAEL SIPSER (M.I.T.) 


The Department of Computer Science of the University of Chicago will 
host a one week course on Circuit Complexity and Lower Bounds, a core 
area of the Theory of Computing, with Professor Michael Sipser from 
M.I.T. as the principal speaker. 

The format of the course, as in previous similar courses (by Hartmanis,
Tarjan, Lovasz, Spencer, etc.), is two lectures a day for five days by the 
principal speaker, augmented by a small number of additional talks.

The following is a partial list of speakers:

Ravi Boppana (Rutgers)
Leonid A. Levin (Boston University)
Noam Nisan (M.I.T.)
Joel Spencer (SUNY at Stony Brook and Courant Institute)
Avi Wigderson (Hebrew University)

A number of experts have indicated their interest in participating.
It is expected that the relaxed schedule of the program and the pleasant
atmosphere of the University of Chicago campus will encourage a lot of 
informal interaction among the participants. The lectures are intended 
to be accessible to graduate students in the Theory of Computing as well 
as to mathematicians with interest in the area.

Inexpensive lodging and food will be provided at university dorms, with the
Hyde Park Hilton as an alternative. A limited amount of financial aid 
will be available.

Registration forms with further details will be sent out in the near future.

The organizers of the course are

L. Babai                           J. Simon
        Department of Computer Science
        The University of Chicago
        1100 E. 58th St.
        CHICAGO, IL 60637

laci@anubis.uchicago.edu           simon@anubis.uchicago.edu