On the complexity of computing maximum entropy for Markovian models

DOI10.4230/LIPICS.FSTTCS.2014.571MaRDI QIDQ2978546zbMATH OpenOpenAlexFDO

Authors Taolue Chen, Tingting Han

Publication date 25 April 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2014.html#ChenH14

zbMATH Keywords

complexityentropyMarkovian modelsprobabilistic verification

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Recommendations

• The Complexity of Approximating the Entropy
• Computing bounds for entropy of stationary \(\mathbb{Z}^d\) Markov random fields
• Entropy, optimization and counting
• Maximizing entropy over Markov processes
• Maximum entropy for countable Markov chains

Cited in

(8)

• On the computation of entropy prior complexity and marginal prior distribution for the Bernoulli model
• The operator approach to entropy games
• Quantifying information leakage of randomized protocols
• The complexity of estimating min-entropy
• Computing bounds for entropy of stationary \(\mathbb{Z}^d\) Markov random fields
• Maximizing entropy over Markov processes
• Maximizing entropy over Markov processes
• Entropy Maximization for Markov Decision Processes Under Temporal Logic Constraints

This page was built for publication: On the complexity of computing maximum entropy for Markovian models

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