2432 search results - page 75 / 487 » Degrees and choice numbers |
142
click to vote
JC
2007
15 years 6 months ago
2007
We present a deterministic algorithm for computing all irreducible factors of degree ≤ d of a given bivariate polynomial f ∈ K[x, y] over an algebraic number field K and their...
132
click to vote
AAECC
2000
Springer
15 years 6 months ago
2000
Springer
Computing only the low degree terms of the product of two univariate polynomials is called a short multiplication. By decomposition into subproblems, a short multiplication can be ...
168
click to vote
ICNP
2003
IEEE
15 years 11 months ago
2003
IEEE
Overlay networks among cooperating hosts have recently emerged as a viable solution to several challenging problems, including multicasting, routing, content distribution, and pee...
125
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
The relative position between two objects in a 2D raster image is often represented quantitatively by a force histogram. In the general case, force histograms are computed in O(KN...
149
click to vote
COMBINATORICA
2007
15 years 6 months ago
2007
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n + 4m)/21 vertices. In the particular case n = m,...