Sciweavers

235 search results - page 9 / 47
» Average-case complexity and decision problems in group theor...
Sort
View
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 8 months ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...
ECAI
2008
Springer
13 years 9 months ago
A Simulation-based Approach for Solving Generalized Semi-Markov Decision Processes
Time is a crucial variable in planning and often requires special attention since it introduces a specific structure along with additional complexity, especially in the case of dec...
Emmanuel Rachelson, Gauthier Quesnel, Fréd&...
ATAL
2003
Springer
14 years 28 days ago
Distribution of goals addressed to a group of agents
The problem investigated in this paper is the distribution of goals addressed to a group of rational agents. Those agents are characterized by their ability (i.e. what they can do...
Laurence Cholvy, Christophe Garion
IPL
2006
118views more  IPL 2006»
13 years 7 months ago
Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebr...
Stéphanie Delaune
AB
2007
Springer
13 years 11 months ago
Reduction of Algebraic Parametric Systems by Rectification of Their Affine Expanded Lie Symmetries
Lie group theory states that knowledge of a m-parameters solvable group of symmetries of a system of ordinary differential equations allows to reduce by m the number of equations. ...
Alexandre Sedoglavic