Theory of Computing Systems

The paper studies learnability from positive data for families of down-sets in quasi-orders, and for families of ideals in Boolean algebras. We establish some connections between learnability and algebraic properties of the underlying structures. ...${}_{}$$\mathbf{}$${}_{}$${}_{}$$\mathbf{}$$\mathbf{}$$\mathbf{}$$\mathbf{}$$\mathbf{}$$\mathbf{}$

Recently, Pasarkar et al. (2023) have introduced the new $\mathtt{TFNP}$ subclass called $\mathtt{PLC}$ that contains the class $\mathtt{PPP}$; they also have proven that several search problems related to extremal combinatorial principles (e.g., Ramsey’s theorem and the ...$\mathtt{}$$\mathtt{}$$\mathit{}$$\mathit{}$${\mathtt{}}_{}^{\mathtt{}}$$\mathit{}$$\mathit{}$${\mathtt{}}^{\mathtt{}}$$\mathtt{}$$\mathtt{}$$\mathtt{}$