1092 search results - page 35 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
ISSAC
2005
Springer
15 years 5 months ago
2005
Springer
We reduce the problem of computing the rank and a nullspace basis of a univariate polynomial matrix to polynomial matrix multiplication. For an input n×n matrix of degree d over ...
101
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
108
click to vote
JSC
2011
14 years 2 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
STOC
2002
ACM
16 years 2 days ago
2002
ACM
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
ACL
2003
15 years 1 months ago
2003
We augment a model of translation based on re-ordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computati...