Information inequality problem over set functions

DOI10.4230/LIPICS.ICDT.2024.19MaRDI QIDQ6902068zbMATH OpenFDO

Authors Miika Hannula

Publication date 11 November 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICDT.2024.19

zbMATH Keywords

computational complexityentropyinformation theoryworst-case output size

Mathematics Subject Classification ID

Database theory (68P15)

Cites work

• A non-Shannon-type conditional inequality of information quantities
• An information-theoretic approach to normal forms for relational and XML data
• Applications of information inequalities to database theory problems
• Complexity of automaton identification from given data
• Conditional Information Inequalities for Entropic and Almost Entropic Points
• Constraint solving via fractional edge covers
• Decision problems in information theory
• Information theory and network coding
• Integrity constraints revisited: from exact to approximate implication
• On the undecidability of implications between embedded multivalued database dependencies
• Size and treewidth bounds for conjunctive queries
• Size bounds and query plans for relational joins
• Two-segmented channel routing is strong NP-complete
• Undecidability of Network Coding, Conditional Information Inequalities, and Conditional Independence Implication
• Worst-case optimal join algorithms

This page was built for publication: Information inequality problem over set functions

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