Suchergebnisse - G.2.1 [Mathematics of computing]: Combinatorics - Combinatorial algorithms

Controlled non-uniform random generation of decomposable structures von Denise, A., Ponty, Y., Termier, M.

“… Consider a class of decomposable combinatorial structures, using different types of atoms Z = { Z 1 , … , Z ∣ Z …”
Volltext

A fast average case algorithm for lyndon decomposition von Iliopoulos, C. S., Smyth, W. F.

“… A simple algorithm, called LD, is described for computing the Lyndon decomposition of a word of length …”
Volltext

Computer algebra and desuspensions of stunted real projective spaces von Nakos, George, Glinos, Nikolaos

“… This is related to a particularly interesting formal power series, the [2]-series. Although our motivation stems from topology, we define the problems in a purely combinatorial way and indicate its usefulness …”
Volltext