1383 search results - page 31 / 277 » On the Complexity of the Interlace Polynomial |
DCC
2008
IEEE
15 years 9 months ago
2008
IEEE
A probabilistic algorithm is presented for finding a basis of the root space of a linearized polynomial L(x) = t i=0 Lixqi over Fqn . The expected time complexity of the presented ...
ECAI
2006
Springer
15 years 1 months ago
2006
Springer
We describe Polynomial Conditional Random Fields for signal processing tasks. It is a hybrid model that combines the ability of Polynomial Hidden Markov models for modeling complex...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
We discuss efficient conversion algorithms for orthogonal polynomials. We describe a known conversion algorithm from an arbitrary orthogonal basis to the monomial basis, and deduc...
ECCC
2010
14 years 10 months ago
2010
We investigate the complexity of the following computational problem: Polynomial Entropy Approximation (PEA): Given a low-degree polynomial mapping p : Fn Fm , where F is a finite...
IPPS
1997
IEEE
15 years 2 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...