3228 search results - page 374 / 646 » Computationally Sound Proofs |
128
click to vote
LACL
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...
151
click to vote
COMPGEOM
1996
ACM
15 years 8 months ago
1996
ACM
We show that in the worst case, (ndd=2e;1 +n logn) sidedness queries are required to determine whether the convex hull of n points in IRd is simplicial, or to determine the number ...
137
click to vote
PKC
2000
Springer
15 years 7 months ago
2000
Springer
For the two last decades, electronic authentication has been an important topic. The first applications were digital signatures to mimic handwritten signatures for digital document...
142
Voted
ASIACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
117
click to vote
CSCW
2008
ACM
15 years 5 months ago
2008
ACM
There is a growing interest in applying market mechanisms to tackle everyday communication problems such as communication interruptions and communication overload. Prior analytic ...