1379 search results - page 121 / 276 » The Complexity of the Annihilating Polynomial |
152
click to vote
IJHPCA
2006
15 years 6 months ago
2006
In this paper we study the scheduling of multiple divisible loads on a star network of processors. We show that this problem is computationally hard. Special cases solvable in pol...
171
click to vote
ACTA
1998
15 years 6 months ago
1998
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
165
click to vote
ECCC
2006
15 years 6 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
131
click to vote
SIAMCOMP
1998
15 years 6 months ago
1998
We first present an algorithm that uses membership and equivalence queries to exactly identify a discretized geometric concept defined by the union of m axis-parallel boxes in d-...
156
click to vote
ISSAC
2009
Springer
16 years 1 months ago
2009
Springer
An Artin-Schreier tower over the finite field Fp is a tower of field extensions generated by polynomials of the form Xp − X − α. Following Cantor and Couveignes, we give a...