Results 21 to 30 of about 693,136 (285)
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
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
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
, 1998 It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, S D
core +1 more source
Polynomial solutions to constant coefficient differential equations [PDF]
Transactions of the American Mathematical Society, 1992 Let D 1 , … , D r ∈ C [ ∂ / ∂ x 1 , … , ∂ / ∂
openaire +2 more sources
The Zhegalkin Polynomial of Multiseat Sole Sufficient Operator
Моделирование и анализ информационных систем, 2023 Among functionally complete sets of Boolean functions, sole sufficient operators are of particular interest. They have a wide range of applicability and are not limited to the two-seat case.
Leonid Y. Bystrov, Egor V. Kuzmin
doaj +1 more source
A saturation property for the spectral-Galerkin approximation of a Dirichlet problem in a square [PDF]
, 2018 Both practice and analysis of adaptive $p$-FEMs and $hp$-FEMs raise the question what increment in the current polynomial degree $p$ guarantees a $p$-independent reduction of the Galerkin error.
Canuto, Claudio +3 more
core +3 more sources
Determining projection constants of univariate polynomial spaces
Journal of Approximation Theory, 2018 The long-standing problem of minimal projections is addressed from a computational point of view. Techniques to determine bounds on the projection constants of univariate polynomial spaces are presented. The upper bound, produced by a linear program, and the lower bound, produced by a semidefinite program exploiting the method of moments, are often ...
Foucart, Simon, Lasserre, Jean-Bernard
openaire +5 more sources
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