1383 search results - page 69 / 277 » On the Complexity of the Interlace Polynomial |
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...
185
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
160
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...
130
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
While most polynomial Julia sets are computable, it has been recently shown [12] that there exist non-computable Julia sets. The proof was non-constructive, and indeed there were ...