Results 51 to 60 of about 3,634,484 (348)
Fast constant-time gcd computation and modular inversion
IACR Cryptology ePrint Archive, 2019 This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believed to ...
D. Bernstein, Bo-Yin Yang
semanticscholar +1 more source
Edit Distance with Block Deletions
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +1 more source
On Lower Bounds for Constant Width Arithmetic Circuits
, 2009 The motivation for this paper is to study the complexity of constant-width arithmetic circuits. Our main results are the following. 1. For every k > 1, we provide an explicit polynomial that can be computed by a linear-sized monotone circuit of width ...
Arvind, V. +2 more
core +2 more sources
A Jacobi Dual-Petrov-Galerkin Method for Solving Some Odd-Order Ordinary Differential Equations
Abstract and Applied Analysis, 2011 A Jacobi dual-Petrov-Galerkin (JDPG) method is introduced and used for solving fully integrated reformulations of third- and fifth-order ordinary differential equations (ODEs) with constant coefficients.
E. H. Doha, A. H. Bhrawy, R. M. Hafez
doaj +1 more source
Robust stability analysis of DC microgrids with constant power loads [PDF]
American Control Conference, 2017 This paper studies stability analysis of DC microgrids with uncertain constant power loads (CPLs). It is well known that CPLs have negative impedance effects, which may cause instability in a DC microgrid.
Jianzhe Liu, Wei Zhang, G. Rizzoni
semanticscholar +1 more source
The best constant of Sobolev inequality corresponding to anti-periodic boundary value problem
Electronic Journal of Qualitative Theory of Differential Equations, 2014 In this paper we establish the best constant of $\mathcal{L}^{p}$ Sobolev inequality for a function with anti-periodic boundary conditions. The best constant is expressed by $\mathcal{L}^q$ norm of $(M-1)$-th order Euler polynomial.
Jozef Kiseľák
doaj +1 more source
Meromorphic solutions of three certain types of non-linear difference equations
AIMS Mathematics, 2021 In this paper, the representations of meromorphic solutions for three types of non-linear difference equations of form $ f^{n}(z)+P_{d}(z, f) = u(z)e^{v(z)}, $ $ f^{n}(z)+P_{d}(z, f) = p_{1}e^{\lambda z}+p_{2}e^{-\lambda z} $ and $
Min Feng Chen +2 more
doaj +1 more source
A characterization of the four Chebyshev orthogonal families
International Journal of Mathematics and Mathematical Sciences, 2005 We obtain a property which characterizes the Chebyshev orthogonal polynomials of first, second, third, and fourth kind. Indeed, we prove that the four Chebyshev sequences are the unique classical orthogonal polynomial families such that their linear ...
E. Berriochoa +2 more
doaj +1 more source
A New Method to Obtain PH-Helical Curves in E^(n+1)
Journal of New Theory, 2021 Helical curves are constructed by the property that their unit tangents make a constant angle with a chosen constant direction. There are relations between polynomial planar curves, helices and Pythagorean-hodograph or shortly PH-curves.
Çetin Camcı +3 more
doaj +1 more source
Decomposition of differential polynomials with constant coefficients [PDF]
Proceedings of the 2004 international symposium on Symbolic and algebraic computation, 2004 In this paper, we present an algorithm to decompose differential polynomials in one variable and with rational number as coefficients. Besides arithmetic operations, the algorithm needs only factorization of multi-variable polynomials and solution of linear equation systems. Experimental results show that our method is quite efficient.
Xiao-Shan Gao, Mingbo Zhang
openalex +3 more sources