2233 search results - page 133 / 447 » On the Complexity of Theory Curbing |
166
click to vote
ENTCS
2006
15 years 6 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
208
click to vote
ENTCS
2006
15 years 6 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
134
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
We study xpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sho...
177
click to vote
CORR
1999
Springer
15 years 6 months ago
1999
Springer
In this article, we study parameterized complexity theory from the perspective of logic, or more specifically, descriptive complexity theory. We propose to consider parameterized ...
237
click to vote
MST
2010
15 years 1 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...