Results 41 to 46 of about 331 (46)

Increasing and Decreasing Subsequences

, 2006
R. Stanley
semanticscholar   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Short Block-Move–CPP is NP-Complete

Matemática Contemporânea, 2020
The Closest Object Problem aims to find one object in the center of all others. It was studied for strings with respect to the Hamming distance, where the Hamming Closest String Problem was settled to be NP-complete. The Closest Permutation Problem (CPP)
L. Cunha, Vinícius dos Santos, L. Kowada, Celina de Figueiredo   +3 more
semanticscholar   +1 more source

On the recursion formula of polynomials generated by rational functions

International Journal of Mathematical Analysis, 2019
Our goal in this work is to found the unified recursion formula of polynomials associated to rational generating functions.
M. Goubi
semanticscholar   +1 more source

Encoding of partition set using sub-exceeding function

, 2018
Luc Rabefihavanana
semanticscholar   +1 more source

Equality to the unit of a sum containing alternating products of binomial coefficients

, 2018
A. Nikonov
semanticscholar   +1 more source

Differential equations associated with twisted tangent polynomials

, 2016
C. Ryoo
semanticscholar   +1 more source