1998 search results - page 54 / 400 » Complexity of the Cover Polynomial |
ESA
2006
Springer
14 years 1 months ago
2006
Springer
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algeb...
DCC
2008
IEEE
14 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
14 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
13 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
13 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...