1379 search results - page 71 / 276 » The Complexity of the Annihilating Polynomial |
JSC
2007
15 years 14 days ago
2007
We present a new algorithm for the computation of resultants associated with multihomogeneous (and, in particular, homogeneous) polynomial equation systems using straight-line pro...
86
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
114
Voted
CPM
2008
Springer
15 years 2 months ago
2008
Springer
We present an algorithm for computing the edit distance of two RNA structures with arbitrary kinds of pseudoknots. A main benefit of the algorithm is that, despite the problem is N...
95
Voted
CORR
2007
Springer
15 years 17 days ago
2007
Springer
We investigate the following question: if a polynomial can be evaluated at rational points by a polynomial-time boolean algorithm, does it have a polynomial-size arithmetic circuit...
JC
2000
15 years 11 days ago
2000
We rst review thebasic properties of the well knownclasses of Toeplitz, Hankel, Vandermonde, and other related structured matrices and reexamine their correlation to operations wi...