199 search results - page 26 / 40 » On some Algorithmic Problems for Groups and Monoids |
ASIACRYPT
2007
Springer
14 years 1 months ago
2007
Springer
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in ...
ASIACRYPT
2001
Springer
14 years 1 days ago
2001
Springer
Abstract. Frey and R¨uck gave a method to transform the discrete logarithm problem in the divisor class group of a curve over Fq into a discrete logarithm problem in some finite ...
AAAI
2008
13 years 9 months ago
2008
In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together i...
BMCBI
2008
13 years 7 months ago
2008
Background: In many research areas it is necessary to find differences between treatment groups with several variables. For example, studies of microarray data seek to find a sign...
AAAI
2007
13 years 9 months ago
2007
A key problem when forming effective coalitions of autonomous agents is determining the best groupings, or the optimal coalition structure, to select to achieve some goal. To this...