pith. sign in

arxiv: 1703.08625 · v3 · pith:3BZ4NEVFnew · submitted 2017-03-24 · 💻 cs.IT · math.IT

PSPACE hardness of approximating the capacity of Markoff channels with noiseless feedback

classification 💻 cs.IT math.IT
keywords capacityfeedbackmarkoffnoiselessapproximatingchannelchannelscomputing
0
0 comments X
read the original abstract

It will be proved that computing the capacity of a Markoff channel with noiseless feedback is PSPACE-hard.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.