These two aims have been the subject of intense research efforts over the past twenty five years, and these efforts have been extremely fruitful with a wealth of fundamental results, both positive and negative results in areas such as approximation algorithms, circuit lower bounds, and the relationship between intractability and randomized computation. Computational intractability is of direct interest to a large number of researchers working in the theory of algorithms and complexity theory. The field of complexity lower bounds has been an area of interest to discrete mathematicians and logicians. Algorithm design and analysis fosters interactions between theoreticians, discrete mathematicians, probabilists, and researchers in applied areas who need to use algorithms for hard problems. The search for new mathematical approaches in both complexity theory and algorithms is causing the field to branch out to other areas of mathematics, e.g., algebraic geometry and topology, and we will encourage interactions with these and other fields.
Some funds are available for travel and local support.