2969 search results - page 7 / 594 » A space efficient algorithm for group structure computation |
ESA
2010
Springer
14 years 9 months ago
2010
Springer
The two dimensional range minimum query problem is to preprocess a static two dimensional m by n array A of size N = m
STACS
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
FOCS
1996
IEEE
15 years 1 months ago
1996
IEEE
PPL
2010
14 years 4 months ago
2010
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
91
Voted
P2PKM
2004
14 years 11 months ago
2004
Abstract. In the future it is likely that peer communities will be routinely established for the purpose of sharing electronic resources and targeted information among groups of pe...