![](https://webarchive.library.unt.edu/eot2008/20081106010637im_/http://www.nsf.gov/images/x.gif)
Event
Constraint Satisfaction Complexity, and Logic
![](https://webarchive.library.unt.edu/eot2008/20081106010637im_/http://www.nsf.gov/images/greenline.jpg)
December 11, 2003 2:00 PM
to December 11, 2003 3:00 PM
NSF, Stafford I, Room 120, Arlington, VA
Lecturer: Dr. Phokion Kolaits
Constraint satisfaction problems constitute a broad class of algorithmic problems that are ubiquitous in several different areas of computer science.
This event is part of Distinguished Lecture Series.
Meeting Type Lecture
Contacts
Michael J. Pazzani, mpazzani@nsf.gov
NSF Related Organizations
Directorate for Computer & Information Science & Engineering
|