1383 search results - page 49 / 277 » On the Complexity of the Interlace Polynomial |
148
click to vote
TOC
2008
15 years 6 months ago
2008
Abstract: This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and polynomials over GF(2)....
160
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we design a low complexity linear MMSE decoder to recover the signal transmitted by M mobile users to a base station equipped with N receiving antennas, arranged as...
192
click to vote
COCO
2011
Springer
14 years 6 months ago
2011
Springer
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
177
click to vote
JSC
2011
14 years 9 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
161
click to vote
ACMSE
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we offer an exposition of a theorem originally due to Adleman, Demarrais and Huang that shows that the quantum complexity class BQP (Bounded-error Quantum Polynomia...