{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T18:31:05Z","timestamp":1769279465486,"version":"3.49.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1109\/itw.2012.6404727","type":"proceedings-article","created":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T15:30:12Z","timestamp":1358436612000},"page":"512-516","source":"Crossref","is-referenced-by-count":11,"title":["On the hardness of entropy minimization and related problems"],"prefix":"10.1109","author":[{"given":"Mladen","family":"Kovacevic","sequence":"first","affiliation":[]},{"given":"Ivan","family":"Stanojevic","sequence":"additional","affiliation":[]},{"given":"Vojin","family":"Senk","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/5326.704595","article-title":"Minimum entropy and information measure","volume":"28","author":"yuan","year":"1998","journal-title":"IEEE Transactions on Systems Man and Cybernetics - Part C"},{"key":"13","author":"papadimitriou","year":"1994","journal-title":"Computational Complexity"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(81)90094-7"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1080\/00207729508929020"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.4171\/093"},{"key":"3","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721182"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/72.298224"},{"key":"10","author":"kapur","year":"1989","journal-title":"Maximum-Entropy Models in Science and Engineering"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.3390\/e3030191"},{"key":"6","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1137\/080720826"},{"key":"4","author":"csisza?r","year":"1981","journal-title":"Information Theory Coding Theorems for Discrete Memoryless Systems"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.106.620"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.926652"}],"event":{"name":"2012 IEEE Information Theory Workshop (ITW 2012)","location":"Lausanne, Switzerland","start":{"date-parts":[[2012,9,3]]},"end":{"date-parts":[[2012,9,7]]}},"container-title":["2012 IEEE Information Theory Workshop"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6389798\/6404631\/06404727.pdf?arnumber=6404727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T01:50:56Z","timestamp":1498009856000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6404727\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/itw.2012.6404727","relation":{},"subject":[],"published":{"date-parts":[[2012,9]]}}}