235 search results - page 7 / 47 » Average-case complexity and decision problems in group theor... |
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
IFIP
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
LICS
2003
IEEE
14 years 29 days ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
ATAL
2003
Springer
14 years 28 days ago
2003
Springer
A team of agents planning to perform a complex task make a number of interrelated decisions as they determine precisely how that complex task will be performed. The decision set i...
LATA
2010
Springer
14 years 5 months ago
2010
Springer
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...