1379 search results - page 53 / 276 » The Complexity of the Annihilating Polynomial |
ICRA
2008
IEEE
15 years 4 months 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...
WG
2005
Springer
15 years 3 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 ...
ACNS
2010
Springer
14 years 11 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 ...
ICC
2007
IEEE
15 years 4 months ago
2007
IEEE
—In this paper we propose an interference detection technique for detecting time varying jamming signals in spread spectrum communication systems. The technique is based on Discr...
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...