Data with logical and statistical constraints

DOI10.1007/978-3-031-86319-6_27MaRDI QIDQ7236654zbMATH OpenFDO

Authors Michel de Rougemont

Publication date 29 April 2026

Full work available at URL https://doi.org/10.1007/978-3-031-86319-6_27

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Combinatorics (05-XX) Computer science (68-XX)

Cites work

• An Introduction to Neural Data Compression
• Average Case Complete Problems
• Definability of combinatorial functions and their linear recurrence relations
• Linear time solvable optimization problems on graphs of bounded clique-width
• On the Relation Between the Relative Earth Mover Distance and the Variation Distance (an Exposition)
• Random sampling with a reservoir
• The parameterised complexity of list problems on graphs of bounded treewidth
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Specker-Blatter theorem does not hold for quaternary relations

This page was built for publication: Data with logical and statistical constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7236654)