1383 search results - page 87 / 277 » On the Complexity of the Interlace Polynomial |
158
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
This paper brings together two lines of research: implicit characterization of complexity classes by Linear Logic (LL) on the one hand, and computation over an arbitrary ring in t...
172
click to vote
JCP
2006
15 years 6 months ago
2006
Finding a maximum cardinality matching in a graph is a problem appearing in numerous settings. The problem asks for a set of edges of maximum cardinality, such that no two edges of...
172
click to vote
ESA
2009
Springer
16 years 26 days ago
2009
Springer
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
169
click to vote
ICCV
2007
IEEE
16 years 18 days ago
2007
IEEE
This paper shows that structure from motion is NP-hard for most sensible cost functions when missing data is allowed. The result provides a fundamental limitation of what is possi...
150
click to vote
JACM
2000
15 years 6 months ago
2000
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...