Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site ucbvax.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!cbosgd!ucbvax!daemon
From: daemon@ucbvax.UUCP
Newsgroups: fa.arpa-bboard
Subject: Call for papers
Message-ID: <995@ucbvax.UUCP>
Date: Wed, 6-Jun-84 19:42:30 EDT
Article-I.D.: ucbvax.995
Posted: Wed Jun  6 19:42:30 1984
Date-Received: Thu, 7-Jun-84 19:43:08 EDT
Sender: daemon@ucbvax.UUCP
Organization: U.C. Berkeley
Lines: 89

From GSB@MIT-MC  Wed Jun  6 16:41:38 1984
			   CALL FOR PAPERS

Symposium on Complexity of Approximately Solved Problems

April 17-19, 1985

Computer Science Department
Columbia University
New York, NY  10027

SUPPORT:  This symposium is supported by a grant from the System Development
Foundation.

SCOPE:  This multidisciplinary symposium focuses on problems which are
approximately solved and for which optimal algorithms or complexity results
are available.  Of particular interest are distributed systems, where
limitations on information flow can cause uncertainty in the approximate
solution of problems.  The following is a partial list of topics:  distributed
computation, approximate solution of hard problems, applied mathematics,
signal processing, numerical analysis, computer vision, remote sensing,
fusion of information, prediction, estimation, control, decision theory,
mathematical economics, optimal recovery, seismology, information theory,
design of experiments, stochastic scheduling.

INVITED SPEAKERS:  The following is a list of invited speakers.

L. Blum, Mills College			J. Halpern, IBM

L. Hurwicz, University of Minnesota	D. Johnson, AT&T - Bell Laboratories

J. Kadane, Carnegie-Mellon University	R. Karp, Berkeley

H.T. Kung, Carnegie-Mellon University	D. Lee, Columbia University

M. Milanese, Politecnico di Torino	C.H. Papadimitriou, Stanford University

J. Pearl, UCLA				M. Rabin, Harvard University and
						  Hebrew University

S. Reiter, Northwestern University	A. Schonhage, University of Tubingen

K. Sikorski, Columbia University	S. Smale, Berkeley

J.F. Traub, Columbia University		G. Wasilkowski, Columbia University
					    and University of Warsaw   

A.G. Werschulz, Fordham University	H. Wozniakowski, Columbia University
					    and University of Warsaw


CONTRIBUTED PAPERS:  All appropriate papers for which abstracts are contributed
will be scheduled.  To contribute a paper send title, author, affiliation, and
abstract on one side of a single 8 1/2 by 11 sheet of paper.


	  TITLES AND ABSTRACTS MUST BE RECEIVED BY JANUARY 15, 1985


PUBLICATION:  Invited papers will be published.

REGISTRATION:  The symposium will be held in the Kellogg Conference Center on
the Fifteenth Floor of the International Affairs Building, 118th Street and
Amsterdam Avenue.  The conference schedule and paper abstracts will be
available at the registration desk.  Registration will start at 9:00 a.m.
There is no registration charge.

FOR FURTHER INFORMATION:  The program schedule for invited and contributed
papers will be mailed by about March 15 only to those responding to this
Call for Papers.  If you have any questions, contact TRAUB@Columbia-20.ARPA.

To help us plan for the symposium please send the following information to
NG@Columbia-20.ARPA.


Name: ________________________ Affiliation: _______________________________

Address: __________________________________________________________________

City: ___________________ State: _____________________ Zip: _______________


( ) I will attend the Complexity Symposium.

( ) I may contribute a paper.

( ) I may not attend, but please send program.
-------