Sciweavers

6 search results - page 1 / 2
» Relatively prime polynomials and nonsingular Hankel matrices...
Sort
View
JCT
2011
85views more  JCT 2011»
12 years 11 months ago
Relatively prime polynomials and nonsingular Hankel matrices over finite fields
Mario García-Armas, Sudhir R. Ghorpade, Sam...
STOC
2009
ACM
156views Algorithms» more  STOC 2009»
14 years 5 months ago
Polynomial-time theory of matrix groups
We consider matrix groups, specified by a list of generators, over finite fields. The two most basic questions about such groups are membership in and the order of the group. Even...
László Babai, Robert Beals, Á...
PKC
2000
Springer
118views Cryptology» more  PKC 2000»
13 years 8 months ago
An Identification Scheme Based on Sparse Polynomials
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
William D. Banks, Daniel Lieman, Igor Shparlinski
CORR
2008
Springer
162views Education» more  CORR 2008»
13 years 4 months ago
Compressed Modular Matrix Multiplication
Matrices of integers modulo a small prime can be compressed by storing several entries into a single machine word. Modular addition is performed by addition and possibly subtracti...
Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
COMBINATORICS
2006
124views more  COMBINATORICS 2006»
13 years 4 months ago
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
A "hybrid method", dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singulari...
Philippe Flajolet, Éric Fusy, Xavier Gourdo...