5019 search results - page 27 / 1004 » Computing in Quotient Groups |
166
click to vote
FOCS
1992
IEEE
15 years 6 months ago
1992
IEEE
We announce methods for e cient management of solvable matrix groups over nite elds. We show that solvability and nilpotence can be tested in polynomial-time. Such e ciency seems ...
NDJFL
2010
14 years 8 months ago
2010
We study completely decomposable torsion-free abelian groups of the form GS := nSQpn for sets S . We show that GS has a decidable copy if and only if S is 0 2 and has a computable...
120
click to vote
CIG
2005
IEEE
15 years 7 months ago
2005
IEEE
AbstractGroup utility functions are an extension of the common team utility function for providing multiple agents with a common reinforcement learning signal for learning cooperat...
106
Voted
ISCC
2003
IEEE
15 years 7 months ago
2003
IEEE
The widespread diffusion of mobile computing along with the integration of telecommunication systems and the Internet enables a scenario where the promise of ubiquitous computing ...
127
Voted
IACR
2011
14 years 1 months ago
2011
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...