File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Checking strict positivity of Kraus maps is NP-hard

TitleChecking strict positivity of Kraus maps is NP-hard
Authors
Gaubert, SQu, Z
KeywordsAlgorithms
Analysis of algorithms
Computational complexity
Issue Date2017
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl
Citation
Information Processing Letters, 2017, v. 118, p. 35-43 How to Cite?
DOI: http://dx.doi.org/10.1016/j.ipl.2016.09.008
Persistent Identifierhttp://hdl.handle.net/10722/234648
ISSN
0020-0190
2021 Impact Factor: 0.851
2020 SCImago Journal Rankings: 0.415
ISI Accession Number ID
WOS:000389094200009

 

DC FieldValueLanguage
dc.contributor.authorGaubert, S-
dc.contributor.authorQu, Z-
dc.date.accessioned2016-10-14T13:48:15Z-
dc.date.available2016-10-14T13:48:15Z-
dc.date.issued2017-
dc.identifier.citationInformation Processing Letters, 2017, v. 118, p. 35-43-
dc.identifier.issn0020-0190-
dc.identifier.urihttp://hdl.handle.net/10722/234648-
dc.languageeng-
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl-
dc.relation.ispartofInformation Processing Letters-
dc.rightsThis work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.-
dc.subjectAlgorithms-
dc.subjectAnalysis of algorithms-
dc.subjectComputational complexity-
dc.titleChecking strict positivity of Kraus maps is NP-hard-
dc.typeArticle-
dc.identifier.emailQu, Z: zhengqu@hku.hk-
dc.identifier.authorityQu, Z=rp02096-
dc.description.naturepreprint-
dc.identifier.doi10.1016/j.ipl.2016.09.008-
dc.identifier.scopuseid_2-s2.0-84988734921-
dc.identifier.hkuros269843-
dc.identifier.volume118-
dc.identifier.spage35-
dc.identifier.epage43-
dc.identifier.isiWOS:000389094200009-
dc.publisher.placeNetherlands-
dc.identifier.issnl0020-0190-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats