@inproceedings{https___doi.org_10.4230_lipics.mfcs.2024.73,
    doi = {10.4230/lipics.mfcs.2024.73},
    url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.73},
    author = {Makowski, Michał},
    keywords = {Conditional independence implication, exponential time, tiling problem, Mathematics of computing → Information theory, Theory of computation → Problems, reductions and completeness},
    language = {en},
    title = {On the Complexity of the Conditional Independence Implication Problem with Bounded Cardinalities},
    publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik},
    year = {2024},
    copyright = {Creative Commons Attribution 4.0 International license},
    date-added = {2025-3-12 12:35:34 +0100}
}

@inproceedings{https___doi.org_10.4230_lipics.mfcs.2024.73, doi = {10.4230/lipics.mfcs.2024.73}, url = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2024.73}, author = {Makowski, Michał}, keywords = {Conditional independence implication, exponential time, tiling problem, Mathematics of computing → Information theory, Theory of computation → Problems, reductions and completeness}, language = {en}, title = {On the Complexity of the Conditional Independence Implication Problem with Bounded Cardinalities}, publisher = {Schloss Dagstuhl – Leibniz-Zentrum für Informatik}, year = {2024}, copyright = {Creative Commons Attribution 4.0 International license}, date-added = {2025-3-12 12:35:34 +0100} }