CORR
2008
Springer
14 years 16 days ago
2008
Springer
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
CORR
2008
Springer
14 years 16 days ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
CORR
2008
Springer
14 years 16 days ago
2008
Springer
CORR
2008
Springer
14 years 16 days ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
The cornerstone of any algorithm computing all repetitions in a string of length n in O(n) time is the fact that the number of runs (or maximal repetitions) is O(n). We give a simp...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
CORR
2008
Springer
14 years 16 days ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...