"On the Complexity of Computing Maximum Entropy for Markovian Models."

Taolue Chen, Tingting Han (2014)

> Home

Details and statistics

DOI: 10.4230/LIPICS.FSTTCS.2014.571

access: open

type: Conference or Workshop Paper

metadata version: 2024-09-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/fsttcs/ChenH14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/fsttcs/ChenH14
Taolue Chen, Tingting Han:
On the Complexity of Computing Maximum Entropy for Markovian Models. FSTTCS 2014: 571-583

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.