On the complexity of computing maximum entropy for Markovian Models
From MaRDI portal
Publication:2978546
DOI10.4230/LIPIcs.FSTTCS.2014.571zbMath1360.68501OpenAlexW1948859648MaRDI QIDQ2978546
Publication date: 25 April 2017
Full work available at URL: https://dblp.uni-trier.de/db/conf/fsttcs/fsttcs2014.html#ChenH14
Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
This page was built for publication: On the complexity of computing maximum entropy for Markovian Models