{"id":"https://openalex.org/W2122340891","doi":"https://doi.org/10.1109/tit.2013.2290112","title":"The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing","display_name":"The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing","publication_year":2013,"publication_date":"2013-11-19","ids":{"openalex":"https://openalex.org/W2122340891","doi":"https://doi.org/10.1109/tit.2013.2290112","mag":"2122340891"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2290112","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2290112","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054911291","display_name":"Andreas M. Tillmann","orcid":"https://orcid.org/0000-0002-7744-836X"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas M. Tillmann","raw_affiliation_strings":["Research Group Optimization, TU Darmstadt, Darmstadt, Germany","Res. Group Optimization, Tech. Univ. Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Research Group Optimization, TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Res. Group Optimization, Tech. Univ. Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033982876","display_name":"Marc E. Pfetsch","orcid":"https://orcid.org/0000-0002-0947-7193"},"institutions":[{"id":"https://openalex.org/I31512782","display_name":"Technical University of Darmstadt","ror":"https://ror.org/05n911h24","country_code":"DE","type":"education","lineage":["https://openalex.org/I31512782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marc E. Pfetsch","raw_affiliation_strings":["Research Group Optimization, TU Darmstadt, Darmstadt, Germany","Res. Group Optimization, Tech. Univ. Darmstadt, Darmstadt, Germany"],"affiliations":[{"raw_affiliation_string":"Research Group Optimization, TU Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]},{"raw_affiliation_string":"Res. Group Optimization, Tech. Univ. Darmstadt, Darmstadt, Germany","institution_ids":["https://openalex.org/I31512782"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054911291"],"corresponding_institution_ids":["https://openalex.org/I31512782"],"apc_list":null,"apc_paid":null,"fwci":28.1896,"has_fulltext":false,"cited_by_count":389,"citation_normalized_percentile":{"value":0.99847909,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"60","issue":"2","first_page":"1248","last_page":"1259"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11447","display_name":"Blind Source Separation Techniques","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10378","display_name":"Advanced MRI Techniques and Applications","score":0.9843000173568726,"subfield":{"id":"https://openalex.org/subfields/2741","display_name":"Radiology, Nuclear Medicine and Imaging"},"field":{"id":"https://openalex.org/fields/27","display_name":"Medicine"},"domain":{"id":"https://openalex.org/domains/4","display_name":"Health Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/restricted-isometry-property","display_name":"Restricted isometry property","score":0.8544508814811707},{"id":"https://openalex.org/keywords/underdetermined-system","display_name":"Underdetermined system","score":0.7869133949279785},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5672866106033325},{"id":"https://openalex.org/keywords/compressed-sensing","display_name":"Compressed sensing","score":0.558380126953125},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.5458023548126221},{"id":"https://openalex.org/keywords/mutual-coherence","display_name":"Mutual coherence","score":0.5424431562423706},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5338529348373413},{"id":"https://openalex.org/keywords/coherence","display_name":"Coherence (philosophical gambling strategy)","score":0.5187697410583496},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5158771276473999},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4960344731807709},{"id":"https://openalex.org/keywords/spark","display_name":"SPARK (programming language)","score":0.433879554271698},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4294359087944031},{"id":"https://openalex.org/keywords/isometry","display_name":"Isometry (Riemannian geometry)","score":0.42871519923210144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40326985716819763},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3833015263080597},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.376714289188385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3233385682106018},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1880829632282257},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.09224432706832886}],"concepts":[{"id":"https://openalex.org/C17902559","wikidata":"https://www.wikidata.org/wiki/Q17099734","display_name":"Restricted isometry property","level":3,"score":0.8544508814811707},{"id":"https://openalex.org/C179690561","wikidata":"https://www.wikidata.org/wiki/Q4316110","display_name":"Underdetermined system","level":2,"score":0.7869133949279785},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5672866106033325},{"id":"https://openalex.org/C124851039","wikidata":"https://www.wikidata.org/wiki/Q2665459","display_name":"Compressed sensing","level":2,"score":0.558380126953125},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.5458023548126221},{"id":"https://openalex.org/C45900066","wikidata":"https://www.wikidata.org/wiki/Q6944191","display_name":"Mutual coherence","level":3,"score":0.5424431562423706},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5338529348373413},{"id":"https://openalex.org/C2781181686","wikidata":"https://www.wikidata.org/wiki/Q4226068","display_name":"Coherence (philosophical gambling strategy)","level":2,"score":0.5187697410583496},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5158771276473999},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4960344731807709},{"id":"https://openalex.org/C2781215313","wikidata":"https://www.wikidata.org/wiki/Q3493345","display_name":"SPARK (programming language)","level":2,"score":0.433879554271698},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4294359087944031},{"id":"https://openalex.org/C82457910","wikidata":"https://www.wikidata.org/wiki/Q740207","display_name":"Isometry (Riemannian geometry)","level":2,"score":0.42871519923210144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40326985716819763},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3833015263080597},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.376714289188385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3233385682106018},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1880829632282257},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.09224432706832886},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2013.2290112","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2290112","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":71,"referenced_works":["https://openalex.org/W1550477103","https://openalex.org/W1591116419","https://openalex.org/W1593443060","https://openalex.org/W1666378188","https://openalex.org/W1802414251","https://openalex.org/W1883653182","https://openalex.org/W1965488728","https://openalex.org/W1967717294","https://openalex.org/W1973117123","https://openalex.org/W1976615583","https://openalex.org/W1976709621","https://openalex.org/W1981745143","https://openalex.org/W1986931325","https://openalex.org/W1989762370","https://openalex.org/W1991858502","https://openalex.org/W2005482089","https://openalex.org/W2005969771","https://openalex.org/W2011039300","https://openalex.org/W2012769612","https://openalex.org/W2012961725","https://openalex.org/W2015418199","https://openalex.org/W2018429487","https://openalex.org/W2020390700","https://openalex.org/W2020503492","https://openalex.org/W2022267471","https://openalex.org/W2026653661","https://openalex.org/W2028781966","https://openalex.org/W2028911681","https://openalex.org/W2030449718","https://openalex.org/W2035929826","https://openalex.org/W2049083558","https://openalex.org/W2075779886","https://openalex.org/W2088095791","https://openalex.org/W2099641086","https://openalex.org/W2100440346","https://openalex.org/W2111067490","https://openalex.org/W2111319461","https://openalex.org/W2114229579","https://openalex.org/W2116148865","https://openalex.org/W2129131372","https://openalex.org/W2134474909","https://openalex.org/W2136235822","https://openalex.org/W2138777601","https://openalex.org/W2144629557","https://openalex.org/W2153988305","https://openalex.org/W2154332973","https://openalex.org/W2156043924","https://openalex.org/W2156425035","https://openalex.org/W2167500642","https://openalex.org/W2168458522","https://openalex.org/W2296616510","https://openalex.org/W2334145331","https://openalex.org/W2401610261","https://openalex.org/W2604387822","https://openalex.org/W2615253071","https://openalex.org/W2951417773","https://openalex.org/W2952736586","https://openalex.org/W2998757566","https://openalex.org/W3102903867","https://openalex.org/W3105703423","https://openalex.org/W4205390861","https://openalex.org/W4210431029","https://openalex.org/W4235713725","https://openalex.org/W4246241896","https://openalex.org/W4250955649","https://openalex.org/W4293777525","https://openalex.org/W4293860921","https://openalex.org/W4298007173","https://openalex.org/W4302125393","https://openalex.org/W6656219545","https://openalex.org/W6677493798"],"related_works":["https://openalex.org/W1595179898","https://openalex.org/W2949399405","https://openalex.org/W4237430004","https://openalex.org/W4301619540","https://openalex.org/W1523391825","https://openalex.org/W2300663769","https://openalex.org/W2025666718","https://openalex.org/W4246056924","https://openalex.org/W1975177374","https://openalex.org/W1978696990"],"abstract_inverted_index":{"This":[0],"paper":[1],"deals":[2],"with":[3],"the":[4,12,17,32,45,48,54,60,112,117,131,135,160],"computational":[5],"complexity":[6,154],"of":[7,15,63,137],"conditions":[8,36],"which":[9,116,142],"guarantee":[10],"that":[11,76,92,133],"NP-hard":[13],"problem":[14],"finding":[16],"sparsest":[18],"solution":[19],"to":[20,159],"an":[21],"underdetermined":[22],"linear":[23],"system":[24],"can":[25],"be":[26],"solved":[27],"by":[28,90],"efficient":[29],"algorithms.":[30],"In":[31],"literature,":[33],"several":[34,153],"such":[35],"have":[37],"been":[38,71],"introduced.":[39],"The":[40],"most":[41],"well-known":[42],"ones":[43],"are":[44,128],"mutual":[46,61],"coherence,":[47],"restricted":[49],"isometry":[50],"property":[51,56],"(RIP),":[52],"and":[53,79,102],"nullspace":[55],"(NSP).":[57],"While":[58],"evaluating":[59,77],"coherence":[62],"a":[64,94,138],"given":[65,95],"matrix":[66,96,139],"is":[67,81,140,143],"easy,":[68],"it":[69],"has":[70],"suspected":[72],"for":[73,93,115],"some":[74],"time":[75],"RIP":[78,118],"NSP":[80,120],"computationally":[82],"intractable":[83],"in":[84,123,146],"general.":[85],"We":[86],"confirm":[87],"these":[88],"conjectures":[89],"showing":[91],"<formula":[97,105],"formulatype=\"inline\"":[98,106],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[99,107],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex":[100,108],"Notation=\"TeX\">${\\mbi{A}}$</tex></formula>":[101],"positive":[103],"integer":[104],"Notation=\"TeX\">$k$</tex></formula>":[109],",":[110],"computing":[111],"best":[113],"constants":[114],"or":[119],"hold":[121],"is,":[122],"general,":[124],"NP-hard.":[125],"These":[126],"results":[127],"based":[129],"on":[130],"fact":[132],"determining":[134],"spark":[136],"NP-hard,":[141],"also":[144,151],"established":[145],"this":[147],"paper.":[148],"Furthermore,":[149],"we":[150],"give":[152],"statements":[155],"about":[156],"problems":[157],"related":[158],"above":[161],"concepts.":[162]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":12},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":17},{"year":2022,"cited_by_count":34},{"year":2021,"cited_by_count":70},{"year":2020,"cited_by_count":35},{"year":2019,"cited_by_count":44},{"year":2018,"cited_by_count":29},{"year":2017,"cited_by_count":46},{"year":2016,"cited_by_count":21},{"year":2015,"cited_by_count":26},{"year":2014,"cited_by_count":23},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}