Grant: Discovery Grants Program - Individual
Simon Fraser University
$34,000.00
Meta-Algorithms versus Circuit Lower Bounds
FY 2013-14
Summary
Computers have dramatically changed our lives. We can now efficiently solve many computational problems that would be impossible to solve without computers. Yet, many important problems still seem beyond the reach of even our most powerful super-computers. Is the apparent difficulty of these problems real (intrinsic to the problem), or these problems do have efficient algorithmic solutions that we haven't been able to discover yet?The field of computational complexity studies precisely this question: what problems require excessive computational resources (computation time, memory, etc.)? In addition to clarifying the boundary of what can be solved efficiently, identifying computationally hard problems also has important practical consequences. For instance, the security of virtually all cryptographic systems in use today (including electronic banking) relies on the unproven assumptions that certain computational problems are very hard to solve. Thus, proving that such problems are actually hard would prove that these cryptographic protocols are truly secure. One of important discoveries of modern complexity theory is the deep connectionbetween proving the hardness of computational problems and designing efficient algorithms for related computational problems. The two tasks are like Ying and Yang of Computer Science: progress in one is impossible without progress in the other. The main goal of the proposed research is to gain better insight into this connection, and exploit it to make further progress in both computational hardness and efficient algorithm design.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
298363-2012
Name nom
Kabanets, Valentine
Department département
Computing Science, School of
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2013
Competition year année de concours
2012
Award amount
34000
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
9999
Area of application group en
Not available
Area of application group fr
Non disponible
Area of application en
Not available
Area of application fr
Non disponible
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
Meta-Algorithms versus Circuit Lower Bounds
Keyword
NSERC
Application summary
Computers have dramatically changed our lives. We can now efficiently solve many computational problems that would be impossible to solve without computers. Yet, many important problems still seem beyond the reach of even our most powerful super-computers. Is the apparent difficulty of these problems real (intrinsic to the problem), or these problems do have efficient algorithmic solutions that we haven't been able to discover yet?The field of computational complexity studies precisely this question: what problems require excessive computational resources (computation time, memory, etc.)? In addition to clarifying the boundary of what can be solved efficiently, identifying computationally hard problems also has important practical consequences. For instance, the security of virtually all cryptographic systems in use today (including electronic banking) relies on the unproven assumptions that certain computational problems are very hard to solve. Thus, proving that such problems are actually hard would prove that these cryptographic protocols are truly secure. One of important discoveries of modern complexity theory is the deep connectionbetween proving the hardness of computational problems and designing efficient algorithms for related computational problems. The two tasks are like Ying and Yang of Computer Science: progress in one is impossible without progress in the other. The main goal of the proposed research is to gain better insight into this connection, and exploit it to make further progress in both computational hardness and efficient algorithm design.