A challenge facing theoretical computer scientists today is not so much to obtain more trendy results of limited long term significance, but rather, to try to formulate a more coherent framework and methodology. To meet this challenge more traditional branches of mathematics, in addition to combinatorics, will play a more significant role. This project will investigate circuit complexity, cooperative games and interactive proof systems and develop new proof techniques and methodologies in hopes to obtain a more coherent framework for complexity theory and contribute to our understanding of the nature of computation.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9057486
Program Officer
Dana S. Richards
Project Start
Project End
Budget Start
1990-08-15
Budget End
1995-01-31
Support Year
Fiscal Year
1990
Total Cost
$144,000
Indirect Cost
Name
Princeton University
Department
Type
DUNS #
City
Princeton
State
NJ
Country
United States
Zip Code
08540