On the complexity of the conditional independence implication problem with bounded cardinalities

DOI10.4230/LIPICS.MFCS.2024.73MaRDI QIDQ7241081zbMATH OpenFDO

Authors Michał Makowski

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2024.73

zbMATH Keywords

conditional independence implicationexponential timetiling problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A non-Shannon-type conditional inequality of information quantities
• Decision problems in information theory
• Facets of distribution identities in probabilistic team semantics
• scientific article; zbMATH DE number 1048047 (Why is no real title available?)
• Logical and algorithmic properties of conditional independence and graphical models
• The program-size complexity of self-assembled squares (extended abstract)
• The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems
• The Undecidability of Conditional Affine Information Inequalities and Conditional Independence Implication With a Binary Constraint
• Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication

This page was built for publication: On the complexity of the conditional independence implication problem with bounded cardinalities

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