Sciweavers

368 search results - page 43 / 74
» Arithmetic as a Theory Modulo
Sort
View
APAL
2010
114views more  APAL 2010»
13 years 8 months ago
Classical predicative logic-enriched type theories
A logic-enriched type theory (LTT) is a type theory extended with a primitive mechanism for forming and proving propositions. We construct two LTTs, named LTT0 and LTT 0, which we...
Robin Adams, Zhaohui Luo
PKC
2009
Springer
164views Cryptology» more  PKC 2009»
14 years 9 months ago
Asynchronous Multiparty Computation: Theory and Implementation
Abstract. We propose an asynchronous protocol for general multiparty computation with perfect security and communication complexity O(n2 |C|k) where n is the number of parties, |C|...
Ivan Damgård, Jesper Buus Nielsen, Martin Ge...
INTEGRATION
2008
191views more  INTEGRATION 2008»
13 years 8 months ago
Constant-time addition with hybrid-redundant numbers: Theory and implementations
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...
Ghassem Jaberipur, Behrooz Parhami
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 8 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
CORR
2007
Springer
124views Education» more  CORR 2007»
13 years 8 months ago
Interpolation in Valiant's theory
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
Pascal Koiran, Sylvain Perifel