On the doubly connected domination polynomial of a graph introduce the doubly connected domination
polynomial of a graph. We investigate some properties
One class of equations solvable in radicalsWe derive recurrent formulas for obtaining minimal
polynomials for values of tangents and show
Nonconformal schemes of the finite-element method for nonlinear hyperbolic conservation laws approximation to the mixed statement of an original problem. Our grid schemes are versions of the nonconformal
Chebyshev Polynomials with Zeros outside the Open Arc SegmentThe problem of unitary
polynomials of degree n with real coefficients least deviating from
zero
The approximate conformal mapping onto multiply connected domains coefficients. The
approximate mapping function has the form of a set of Laurent
polynomials in the set
Polynomial Computability of Fields of Algebraic Numbers and the ordered field of real algebraic numbers have isomorphic presentations computable in
polynomial time
ОБ ОПТИМАЛЬНЫХ ПРОЕКЦИОННЫХ МЕТОДАХ РЕШЕНИЯ
ПЕРИОДИЧЕСКИХ ДРОБНО-ИНТЕГРАЛЬНЫХ УРАВНЕНИЙWe consider the solution for the problem of
polynomial projection methods for solving periodic