1379 search results - page 67 / 276 » The Complexity of the Annihilating Polynomial |
156
click to vote
AAAI
2010
15 years 7 months ago
2010
For many election systems, bribery (and related) attacks have been shown NP-hard using constructions on combinatorially rich structures such as partitions and covers. It is import...
154
click to vote
STACS
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. The perfect matching problem is known to be in ¶, in randomized NC, and it is hard for NL. Whether the perfect matching problem is in NC is one of the most prominent ope...
149
click to vote
ICPPW
2005
IEEE
15 years 11 months ago
2005
IEEE
We report on a £rst parallel implementation of a recent algorithm to factor positive dimensional solution sets of polynomial systems. As the algorithm uses homotopy continuation,...
168
click to vote
ISSAC
2005
Springer
15 years 11 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 ...
153
click to vote
ISSAC
2001
Springer
15 years 10 months ago
2001
Springer
The following questions are often encountered in system and control theory. Given an algebraic model of a physical process, which variables can be, in theory, deduced from the inp...