1695 search results - page 24 / 339 » Linear, Polynomial or Exponential |
107
click to vote
DCC
2008
IEEE
16 years 8 days 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 ...
97
Voted
MP
2006
15 years 19 days ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
FOCM
2010
14 years 10 months ago
2010
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
100
click to vote
ICTCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider the problem of maintaining polynomial and exponential decay aggregates of a data stream, where the weight of values seen from the stream diminishes as time el...
108
click to vote
EMO
2005
Springer
15 years 6 months ago
2005
Springer
We present a new analysis of the LebMeasure algorithm for calculating hypervolume. We prove that although it is polynomial in the number of points, LebMeasure is exponential in the...