{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T05:50:06Z","timestamp":1744869006992},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icassp.2005.1415886","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T13:05:52Z","timestamp":1160571952000},"page":"1021-1024","source":"Crossref","is-referenced-by-count":5,"title":["Reducing the Average Complexity of ML Detection using Semidefinite Relaxation"],"prefix":"10.1109","volume":"3","author":[{"family":"Joakim Jalden","sequence":"first","affiliation":[]},{"family":"Bjorn Ottersten","sequence":"additional","affiliation":[]},{"family":"Wing-Kin Ma","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","article-title":"Blind maximum likelihood decoding of orthogonal space-time block codes: A semidefinite relaxation approach","author":"ma","year":"2003","journal-title":"Proc IEEE 2003 Global Commun Conf"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971408"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2002.806561"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.817444"},{"key":"2","first-page":"10","article-title":"The shortest vector problem in L2 is NP-hard for randomized reductions","author":"ajtai","year":"1998","journal-title":"Proc 30th Annu ACM Symp Theory Comput"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01553893"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/78.992139"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/49.942507"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2004.1326846"},{"key":"4","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/062\/10","article-title":"Maximum-likelihood decoding and integer least-squares: The expected complexity","author":"hassibi","year":"2003","journal-title":"Multiantenna Channels Capacity Coding and Signal Processing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2003.1202528"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/0806020"}],"event":{"name":"(ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005.","location":"Philadelphia, Pennsylvania, USA"},"container-title":["Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9711\/30652\/01415886.pdf?arnumber=1415886","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T12:46:36Z","timestamp":1555850796000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1415886\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/icassp.2005.1415886","relation":{},"subject":[]}}