9 search results - page 2 / 2 » A Number System with Continuous Valued Digits and Modulo Ari... |
ALENEX
2004
13 years 7 months ago
2004
There are numerous instances where mathematical constants do not admit a closed form. It is then of great interest to compute them, possibly in an efficient way. So the question i...
JSYML
2002
13 years 5 months ago
2002
Abstract. This paper develops the very basic notions of analysis in a weak secondorder theory of arithmetic BTFA whose provably total functions are the polynomial time computable f...
CAV
1998
Springer
13 years 9 months ago
1998
Springer
As a pedagogical exercise in ACL2, we formalize and prove the correctness of a write invalidate cache scheme. In our formalization, an arbitrary number of processors, each with its...
SSS
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Given a public-key infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all exi...