The inherent complexity of computational and data manipulation problems is investigated. Specific topics studied include Boolean circuit and communication complexity, decision tree models, and the complexity of data structures. A concentrated effort is made at resolving some of the long standing open problems. Techniques from combinatorics, probability theory, and topology provides the main mathematical tools for the project.

Agency
National Science Foundation (NSF)
Institute
Division of Computer and Communication Foundations (CCF)
Application #
9301430
Program Officer
Yechezkel Zalcstein
Project Start
Project End
Budget Start
1993-08-01
Budget End
1997-01-31
Support Year
Fiscal Year
1993
Total Cost
$225,457
Indirect Cost
Name
Princeton University
Department
Type
DUNS #
City
Princeton
State
NJ
Country
United States
Zip Code
08540