Grant: Postgraduate Scholarships - Doctoral
University of Waterloo
$21,000.00
Thresholds for the existence of efficient algorithms that solve NP- Complete problems under property testing relaxations
EF 2021-22
Résumé
Algorithms, Computational Complexity, Theoretical Computer Science, Approximation Algorithms, Property Testing, Machine Learning, Probability Theory, Theoretical Computer Science, NP-Complete Problems
Programme
Postgraduate Scholarships - Doctoral
Bénéficiaire
Emplacement
Ontario, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
558705-2021
Name nom
Seth, Cameron
Department département
Computer Science, David R. Cheriton School of
Organization id
33
Institution établissement
University of Waterloo
Province en
Ontario
Province fr
Ontario
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2021
Competition year année de concours
2021
Award amount
21000
Program id
PGSD
Program name en
Postgraduate Scholarships - Doctoral
Program name fr
Bourses d'études supérieures - doctorat
Group en
Training programs
Group fr
Programmes de bourse
Committee code
198
Committee name en
S&F Committee for Computing Sciences
Committee name fr
Comité de sélection des bourses en informatique
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
2705
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Software and development
Research subject fr
Logiciels et développement
Installment
inst:1; 2
Partie
2
Nb partie
5
Application title
Thresholds for the existence of efficient algorithms that solve NP- Complete problems under property testing relaxations
Keyword
NSERC
Application summary
Algorithms, Computational Complexity, Theoretical Computer Science, Approximation Algorithms, Property Testing, Machine Learning, Probability Theory, Theoretical Computer Science, NP-Complete Problems