235 search results - page 8 / 47 » Average-case complexity and decision problems in group theor... |
ICFP
2007
ACM
14 years 7 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
IOR
2002
13 years 7 months ago
2002
Then these analytically motivated abstractions were gradually made more intricate as the body of mathematical techniques grew. The trend went from elementary analysis of complex, i...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— In this paper, we propose a non-commutative keyexchange scheme which generalizes the classical ElGamal Cipher to polycyclic groups. We will explore other classes of gro...
ALDT
2009
Springer
14 years 2 months ago
2009
Springer
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...