368 search results - page 23 / 74 » Arithmetic as a Theory Modulo |
IACR
2011
12 years 8 months ago
2011
In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a finite field, counting the cost by the number of secure m...
FSEN
2009
Springer
14 years 3 months ago
2009
Springer
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
FUIN
2010
13 years 6 months ago
2010
We provide an equational theory for Restricted Broadcast Process Theory to reason about ad hoc networks. We exploit an extended algebra called Computed Network Theory to axiomatize...
CADE
2008
Springer
14 years 9 months ago
2008
Springer
Satisfiability Modulo Theories (SMT) solvers have proven highly scalable, efficient and suitable for integrated theory reasoning. The most efficient SMT solvers rely on refutationa...
LOGCOM
2007
13 years 8 months ago
2007
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...