28888 search results - page 326 / 5778 » Computability and complexity in analysis |
203
click to vote
LICS
2006
IEEE
16 years 22 days ago
2006
IEEE
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
134
click to vote
MFCS
1990
Springer
15 years 10 months ago
1990
Springer
We introduce the notion of associative one-way functions and prove that they exist if and only if P 6= NP. As evidence of their utility, we present two novel protocols that apply ...
185
click to vote
TNN
2008
15 years 6 months ago
2008
In this paper, we introduce a novel way of performing real-valued optimization in the complex domain. This framework enables a direct complex optimization technique when the cost f...
158
click to vote
IFIP
2004
Springer
16 years 2 days ago
2004
Springer
Abstract The computational proof model of Bellare and Rogaway for cryptographic protocol analysis is complemented by providing a formal specification of the actions of the adversa...
193
click to vote
SIAMREV
2010
15 years 1 months ago
2010
Computational Convex Analysis algorithms have been rediscovered several times in the past by researchers from different fields. To further communications between practitioners, we ...