1383 search results - page 54 / 277 » On the Complexity of the Interlace Polynomial |
146
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
A recent seminal result of R?acke is that for any network there is an oblivious routing algorithm with a polylog competitive ratio with respect to congestion. Unfortunately, R?ack...
154
click to vote
ICASSP
2009
IEEE
16 years 27 days ago
2009
IEEE
The problem under study here is the minimax design of linearphase lowpass FIR filters having variable passband width and implemented through a Farrow structure. We have two main ...
165
click to vote
ICRA
2008
IEEE
16 years 18 days ago
2008
IEEE
— In this paper we present a polynomial Navigation Function (NF) for a sphere world that can be constructed almost locally, with partial knowledge of the environment. The present...
172
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we present a new algorithm for computing the chromatic polynomial of a general graph G. Our method is based on the addition of edges and contraction of non-edges of ...
138
click to vote
ACNS
2010
Springer
15 years 7 months ago
2010
Springer
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...