1802 search results - page 79 / 361 » Complexity Theory for Operators in Analysis |
147
click to vote
CCA
2005
Springer
15 years 8 months ago
2005
Springer
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
163
click to vote
LPAR
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally anal...
156
Voted
SIGECOM
2005
ACM
15 years 11 months ago
2005
ACM
This paper initiates research on the foundations of ranking systems, a fundamental ingredient of basic e-commerce and Internet Technologies. In order to understand the essence and...
173
Voted
IFIP
2010
Springer
15 years 27 days 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...
170
click to vote
GECCO
2006
Springer
15 years 9 months ago
2006
Springer
Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems. The reason for that, however, remains unclear. A framework for a theory of ...