Combinatorial optimisation for permutation problems addresses the challenge of arranging discrete elements in an order that minimises or maximises a given objective function. Such problems include the ...
Permutation polynomials over finite fields form a central theme in modern algebraic research, intertwining group theory, number theory and combinatorial design. A finite field is a set of elements ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results