Grant: Research Tools and Instruments - Category 1 (<$150,000)
University of Victoria
$8,360.00
Computer for memory intensive computation over discrete structures
EF 2008-09
Résumé
Many algorithmic studies of discrete structures call for the exploration of large sets of mathematical data. These explorations sometimes require machines with vast amounts of main memory. The cost of such machines is now quite reasonable, and we plan to use the requested machine to solve some problems that we were unable to solve previously because of lack of access to machines with sufficient memory.
In particular the problems come from the following areas:
(a) statistical studies of the the coefficients of irreducible polynomials and other polynomials over finite fields.
(b) bit distance from prime numbers.
(c) patterns in solutions of nested recurrence relations.
(d) solutions of recurrence relations for certain isoperimetric numbers on infinite graphs.
Programme
Research Tools and Instruments - Category 1 (<$150,000)
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
371406-2009
Name nom
Ruskey, Frank
Department département
Computer Science
Organization id
7
Institution établissement
University of Victoria
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2008
Competition year année de concours
2009
Award amount
8360
Program id
EQPEQ
Program nane en
Research Tools and Instruments - Category 1 (<$150,000)
Program name fr
Outils et instruments de recherche - catégorie 1 (<150 000$)
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
331
Committee name en
Computing and Information Sciences - B
Committee name fr
Informatique - B
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
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
1
Application title
Computer for memory intensive computation over discrete structures
Keyword
NA
Application summary
Many algorithmic studies of discrete structures call for the exploration of large sets of mathematical data. These explorations sometimes require machines with vast amounts of main memory. The cost of such machines is now quite reasonable, and we plan to use the requested machine to solve some problems that we were unable to solve previously because of lack of access to machines with sufficient memory.
In particular the problems come from the following areas:
(a) statistical studies of the the coefficients of irreducible polynomials and other polynomials over finite fields.
(b) bit distance from prime numbers.
(c) patterns in solutions of nested recurrence relations.
(d) solutions of recurrence relations for certain isoperimetric numbers on infinite graphs.