Sciweavers

1092 search results - page 4 / 219
» Polynomial Interpretations and the Complexity of Algorithms
Sort
View
CORR
2006
Springer
87views Education» more  CORR 2006»
14 years 9 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
COCO
2000
Springer
112views Algorithms» more  COCO 2000»
15 years 1 months ago
Combinatorial Interpretation of Kolmogorov Complexity
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
Andrei E. Romashchenko, Alexander Shen, Nikolai K....
IJCSA
2006
121views more  IJCSA 2006»
14 years 9 months ago
Evaluation of the RC4 Algorithm for Data Encryption
Analysis of the effect of different parameters of the RC4 encryption algorithm where examined. Some experimental work was performed to illustrate the performance of this algorithm...
Allam Mousa, Ahmad Hamad
ISSAC
2004
Springer
159views Mathematics» more  ISSAC 2004»
15 years 2 months ago
Complexity issues in bivariate polynomial factorization
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
Alin Bostan, Grégoire Lecerf, Bruno Salvy, ...
JC
2006
105views more  JC 2006»
14 years 9 months ago
On the complexity of the resolvent representation of some prime differential ideals
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
Lisi D'Alfonso, Gabriela Jeronimo, Pablo Solern&oa...