19320 search results - page 157 / 3864 » On the complexity of computing determinants |
122
click to vote
COMPGEOM
1989
ACM
15 years 9 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...
166
click to vote
CSL
2003
Springer
15 years 10 months ago
2003
Springer
For a fixed countable homogeneous relational structure Γ we study the computational problem whether a given finite structure of the same signature homomorphically maps to Γ. T...
109
Voted
SIAMMA
2010
14 years 11 months ago
2010
We consider the inverse problem of determining the spherically symmetric index of refraction n(r) from a knowledge of the corresponding transmission eigenvalues (which can be deter...
127
Voted
ICALP
2000
Springer
15 years 8 months ago
2000
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalism for specifying the quantitative properties to analyze have remained quite primitive. In th...