AI Chat AI Image Generator AI Video Text to Speech

The Ideal Approach to Computing Closed Subsets in Well-Quasi-Ordering

04/24/2019

∙

by Jean Goubault-Larrecq, et al.

∙

∙

Elegant and general algorithms for handling upwards-closed and downwards-closed subsets of WQOs can be developed using the filter-based and ideal-based representation for these sets. These algorithms can be built in a generic or parameterized way, in parallel with the way complex WQOs are obtained by combining or modifying simpler WQOs.

Jean Goubault-Larrecq
9 publications
Simon Halfon
1 publication
Prateek Karandikar
1 publication
K. Narayan Kumar
2 publications
Philippe Schnoebelen
2 publications

research

∙ 09/04/2018

A characterization of the consistent Hoare powerdomains over dcpos

It has been shown that for a dcpo P, the Scott closure of Γ_c(P) in Γ(P)...

0 Zhongxi Zhang, et al. ∙

research

∙ 01/26/2023

Decidability of well quasi-order and atomicity for equivalence relations under embedding orderings

We consider the posets of equivalence relations on finite sets under the...

0 V. Ironmonger, et al. ∙

research

∙ 08/21/2001

On Classes of Functions for which No Free Lunch Results Hold

In a recent paper it was shown that No Free Lunch results hold for any s...

0 Christian Igel, et al. ∙

research

∙ 05/09/2020

Access Structures Determined by Uniform Polymatroids

A secret sharing scheme is a method of sharing a secret key among a fini...

0 Renata Kawa, et al. ∙

research

∙ 08/26/2022

On primary decomposition of Hermite projectors

An ideal projector on the space of polynomials ℂ [𝐱]=ℂ [x_1,… ,x_d] is a...

0 Jaroslaw Buczynski, et al. ∙

research

∙ 01/16/2020

Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours

New algorithms for generating closed knight's tours are obtained by gene...

0 Ian Parberry, et al. ∙