PSPACE hardness of approximating the capacity of time-invariant Markov channels with perfect feedback

DOI10.4310/CIS.2017.V17.N4.A3MaRDI QIDQ1659239zbMATH OpenOpenAlexFDO

Authors Mukul Agarwal

Publication date 15 August 2018

Published in Communications in Information and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4310/cis.2017.v17.n4.a3

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Communication theory (94A05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(1)

• Anytime Capacity of a Class of Markov Channels

This page was built for publication: PSPACE hardness of approximating the capacity of time-invariant Markov channels with perfect feedback

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