Relating description complexity to entropy
From MaRDI portal
Publication:6671671
DOI10.1016/j.jcss.2024.103615MaRDI QIDQ6671671FDOQ6671671
Miikka Vilander, Author name not available (Why is that?), Antti Kuusisto
Publication date: 27 January 2025
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Applications of matrix methods to the theory of lower bounds in computational complexity
- Title not available (Why is that?)
- On Bernoulli sums and Bernstein polynomials
- An n ! lower bound on formula size
- The number of finite relational structures
- Some equivalences between Shannon entropy and Kolmogorov complexity
- Entropy measures vs. Kolmogorov complexity
- Logical complexity of graphs: a survey
- An introduction to Kolmogorov complexity and its applications
- Satisfiability problem for modal logic with global counting operators coded in binary is \textsc{NExpTime}-complete
- On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics
- Formula size games for modal logic and μ-calculus
- Title not available (Why is that?)
This page was built for publication: Relating description complexity to entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671671)
