Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

University of Toronto

$96,000.00

Computational complexity and logic

FY 2012-13

Summary
I plan on continuing my research in both computational complexity and proof complexity. My current work in complexity theory is motivated by the problem of separating logarithmic space (deterministic and nondeterministic) from polynomial time. My collaborators and I have formulated a computational problem (the Tree Evaluation Problem), for which we have a conjectured space-optimal algorithm requiring superlogarithmic space. We use the branching program model of computational space, for which a superpolynomial lower bound on the number of states implies the desired separation. We have proved such a lower bound for restricted branching programs, and will work toward gradually removing the restrictions. In proof complexity I will continue working with my students on projects motivated by understanding the complexity of concepts needed to prove combinatorial theorems.
Program
Discovery Grants Program - Individual
Location
Ontario, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
7755-2011
Name nom
Cook, Stephen
Department département
Computer Science (St. George Campus)
Organization id
31
Institution établissement
University of Toronto
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2012
Competition year année de concours
2011
Award amount
96000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2703
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Complexity
Research subject fr
Complexité
Partie
2
Nb partie
5
Application title
Computational complexity and logic
Keyword
NSERC
Application summary
I plan on continuing my research in both computational complexity and proof complexity. My current work in complexity theory is motivated by the problem of separating logarithmic space (deterministic and nondeterministic) from polynomial time. My collaborators and I have formulated a computational problem (the Tree Evaluation Problem), for which we have a conjectured space-optimal algorithm requiring superlogarithmic space. We use the branching program model of computational space, for which a superpolynomial lower bound on the number of states implies the desired separation. We have proved such a lower bound for restricted branching programs, and will work toward gradually removing the restrictions. In proof complexity I will continue working with my students on projects motivated by understanding the complexity of concepts needed to prove combinatorial theorems.