6533b826fe1ef96bd128508c

RESEARCH PRODUCT

On WQO Property for Different Quasi Orderings of the Set of Permutations

Juris ViksnaSandra Ose

subject

Set (abstract data type)Discrete mathematicsProperty (philosophy)Efficient algorithmComputer scienceComputerApplications_COMPUTERSINOTHERSYSTEMS

description

The property of certain sets being well quasi ordered (WQO) has several useful applications in computer science – it can be used to prove the existence of efficient algorithms and also in certain cases to prove that a specific algorithm terminates.

https://doi.org/10.1007/978-3-642-36046-6_18