Results 251 to 260 of about 12,820,749 (293)

Inverse-Probability-Weighted Kernel Estimation of Regression Derivatives Under Missing-at-Random Responses for Stationary Ergodic Processes. [PDF]

Entropy (Basel)
Bouzebda S, Didi S.
europepmc   +1 more source

Regularization of electromagnetic scattering problems via the Abel integral transform. [PDF]

Philos Trans A Math Phys Eng Sci
Vinogradova E, Smith P.
europepmc   +1 more source

A numerical approach to fractional Volterra-Fredholm integro-differential problems using shifted Chebyshev spectral collocation. [PDF]

Sci Rep
Hamood MM, Sharif AA, Ghadle KP.
europepmc   +1 more source

Physics-informed neural networks with caputo-fabrizio derivatives for nonlinear fractal-fractional delay equations and chaotic systems. [PDF]

Sci Rep
Khan H, Sulaiman M, Laouini G, Rahman IU, Salman MA.   +4 more
europepmc   +1 more source

Finite element thermoelastic analysis of functionally graded spherical shells. [PDF]

Sci Rep
Kumar A, Gupta GK, Singh AK, Lal A.
europepmc   +1 more source

Computational analysis of radiative heat transfer and free convective flow over a vertical wavy surface with Lorentz forces. [PDF]

Sci Rep
Obalalu AM, Khan U, Adeshina IA, Elattar S.   +3 more
europepmc   +1 more source

Timflow: Multi‐Layer Analytic Element Modeling in Continuous Space and Time

Groundwater, EarlyView.
Mark Bakker, Davíd Brakenhoff
wiley   +1 more source

Factors of Dickson Polynomials Over Finite Fields [PDF]

Finite Fields and Their Applications, 2005
We give new descriptions of the factors of Dickson polynomials over finite ...
Robert W Fitzgerald, Joseph Lewis Yucas
exaly   +2 more sources

A New Algorithm for Factoring Polynomials Over Finite Fields

Mathematics of Computation, 1981
We present a new probabilistic algorithm for factoring polynomials over finite fields.
Hans Zassenhaus
exaly   +2 more sources

Faster Polynomial Multiplication Over Finite Fields [PDF]

Journal of the ACM, 2017
Polynomials over finite fields play a central role in algorithms for cryptography, error correcting codes, and computer algebra. The complexity of multiplying such polynomials is still a major open problem. Let p be a prime, and let M p ( n )
David Harvey, Grégoire Lecerf
exaly   +6 more sources