Join Our Newsletter

CORR

2012

Springer

8 years 12 months ago
2012

Springer

Abstract. Let R be a real closed ﬁeld and D ⊂ R an ordered domain. We give an algorithm that takes as input a polynomial Q ⊂ D[X1, . . . , Xk], and computes a description of ...

IACR

2011

9 years 3 months ago
2011

In this paper, we study the complexity of secure multiparty computation using only the secure arithmetic black-box of a ﬁnite ﬁeld, counting the cost by the number of secure m...

ATVA

2011

Springer

9 years 4 months ago
2011

Springer

Abstract. In the traditional Boolean setting of formal veriﬁcation, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...

ICASSP

2011

IEEE

9 years 8 months ago
2011

IEEE

— A new decoding algorithm, referred to as Min-Sum with Adaptive Message Control (AMC-MS), is proposed to reduce the decoding complexity of nonbinary LDPC codes. The proposed alg...

CORR

2011

Springer

9 years 11 months ago
2011

Springer

We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...

CC

2005

Springer

10 years 4 months ago
2005

Springer

Let (n) be the minimum number of arithmetic operations required to build the integer n N from the constants 1 and 2. A sequence xn is said to be "easy to compute" if the...

CORR

2006

Springer

10 years 4 months ago
2006

Springer

We propose algorithms for the computation of the first N terms of a vector (or a full basis) of power series solutions of a linear system of differential equations at an ordinary ...

ALENEX

2004

10 years 5 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...

ANTS

2006

Springer

10 years 8 months ago
2006

Springer

We present the pseudosquares prime sieve, which finds all primes up to n. Define p to be the smallest prime such that the pseudosquare Lp > n/((p)(log n)2 ); here (x) is the pri...

CASES

2009

ACM

10 years 8 months ago
2009

ACM

2's complement number system imposes a fundamental limitation on the power and performance of arithmetic circuits, due to the fundamental need of cross-datapath carry propaga...