365 search results - page 45 / 73 » On the combinatorics of Galois numbers |
101
click to vote
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
COCOON
2008
Springer
15 years 1 months ago
2008
Springer
We analyze the complexity of equilibria problems for a class of strategic zero-sum games, called Angel-Daemon games. Those games were introduced to asses the goodness of a web or g...
CPM
2008
Springer
15 years 1 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
427
click to vote
COCOON
2011
Springer
13 years 11 months ago
2011
Springer
A d-dimensional polycube of size n is a connected set of n cubes in d dimensions, where connectivity is through (d−1)-dimensional faces. Enumeration of polycubes, and, in particu...
ISSAC
2009
Springer
15 years 6 months ago
2009
Springer
In this paper we give a new algorithm to compute Liouvillian solutions of linear difference equations. Compared to the prior algorithm by Hendriks and Singer, our main contributi...