1383 search results - page 134 / 277 » On the Complexity of the Interlace Polynomial |
180
click to vote
ACID
2006
15 years 7 months ago
2006
The Convex Recoloring (CR) problem measures how far a tree of characters differs from exhibiting a so-called "perfect phylogeny". For input consisting of a vertex-colored...
174
click to vote
CANS
2009
Springer
16 years 1 months ago
2009
Springer
At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an ini...
181
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. Let R be a real closed field 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 ...
179
click to vote
ECCC
2007
15 years 6 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
165
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...