3466 search results - page 354 / 694 » Fast computation of special resultants |
177
click to vote
CORR
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. In this paper we develop a general technique to eliminate the assumption of the Generalized Riemann Hypothesis (GRH) from various deterministic polynomial factoring algor...
113
click to vote
DM
2008
15 years 7 months ago
2008
Rahilly [10] described a construction that relates any Hadamard design H on 4m -1 points with a line spread to an affine design having the same parameters as the classical design ...
160
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
158
click to vote
SIAMJO
2008
15 years 6 months ago
2008
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
163
click to vote
IPL
2002
15 years 6 months ago
2002
We consider the problem of dualizing a Boolean function f given by CNF, i.e., computing a CNF for its dual fd . While this problem is not solvable in quasi-polynomial total time i...