7796 search results - page 18 / 1560 » On Generalized Schur Numbers |
AMC
2010
14 years 9 months ago
2010
In this paper, we investigate condition numbers of eigenvalue problems of matrix polynomials with nonsingular leading coefficients, generalizing classical results of matrix pertur...
JC
2007
14 years 9 months ago
2007
We extend the lower bounds on the complexity of computing Betti numbers proved in [6] to complex algebraic varieties. More precisely, we first prove that the problem of deciding ...
107
click to vote
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Abstract. Mesh numbering is a critical issue in Finite Element Methods, as the computational cost of one analysis is highly dependent on the order of the nodes of the mesh. This pa...
115
click to vote
COMGEO
2011
ACM
14 years 4 months ago
2011
ACM
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...