Results 91 to 99 of about 1,084 (99)

Nonadaptive search problem with sets of equal sum

Open Mathematics, 2003
Kolev Emil
doaj   +1 more source

Parity-alternating permutations and successions

Open Mathematics, 2014
Munagi Augustine
doaj   +1 more source

A combinatorial proof of a result for permutation pairs

Open Mathematics, 2012
Mansour Toufik, Shattuck Mark
doaj   +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

Encoding of partition set using sub-exceeding function

, 2018
Luc Rabefihavanana
semanticscholar   +1 more source

A Note on M-Operator Representation of q-Lattices

, 2015
R. Halaš, J. Pócs
semanticscholar   +1 more source

More Combinatorics of Fulton's Essential Set

, 2013
Masato Kobayashi
semanticscholar   +1 more source

The Number Of Permutations Which Form Arithmetic Progressions Modulo m

, 2014
F. Luca, Augustine O. Munagi
semanticscholar   +1 more source

Some results on the (4) problem of Erdös and Hajnal

, 1995
Greg Manning
semanticscholar   +1 more source