1308 search results - page 59 / 262 » Let's Have a Conversation |
157
click to vote
ESA
1994
Springer
15 years 10 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
177
click to vote
ISSAC
2005
Springer
16 years 7 days ago
2005
Springer
Let A and B be two polynomials in [x,y] and let R = resx(A, B) denote the resultant of A and B taken wrt x. In this paper we modify Collins’ modular algorithm for computing R...
176
click to vote
FOCS
1994
IEEE
15 years 10 months ago
1994
IEEE
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
174
click to vote
SIAMDM
2008
15 years 6 months ago
2008
We count all latin cubes of order n 6 and latin hypercubes of order n 5 and dimension d 5. We classify these (hyper)cubes into isotopy classes and paratopy classes (main classe...
216
click to vote
DM
2011
15 years 1 months ago
2011
Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...