{"id":"https://openalex.org/W2127628467","doi":"https://doi.org/10.1109/ciss.2008.4558680","title":"Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form","display_name":"Efficient computation of the M-phase vector that maximizes a rank-deficient quadratic form","publication_year":2008,"publication_date":"2008-03-01","ids":{"openalex":"https://openalex.org/W2127628467","doi":"https://doi.org/10.1109/ciss.2008.4558680","mag":"2127628467"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2008.4558680","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5018630988","display_name":"Dimitris Papailiopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]},{"id":"https://openalex.org/I55741626","display_name":"Technical University of Crete","ror":"https://ror.org/03f8bz564","country_code":"GR","type":"education","lineage":["https://openalex.org/I55741626"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Dimitris S. Papailiopoulos","raw_affiliation_strings":["Department of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece","[Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece","institution_ids":["https://openalex.org/I55741626"]},{"raw_affiliation_string":"[Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania]","institution_ids":["https://openalex.org/I142617266"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5053807674","display_name":"George N. Karystinos","orcid":"https://orcid.org/0000-0002-8649-160X"},"institutions":[{"id":"https://openalex.org/I142617266","display_name":"University of Crete","ror":"https://ror.org/00dr28g20","country_code":"GR","type":"education","lineage":["https://openalex.org/I142617266"]},{"id":"https://openalex.org/I55741626","display_name":"Technical University of Crete","ror":"https://ror.org/03f8bz564","country_code":"GR","type":"education","lineage":["https://openalex.org/I55741626"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"George N. Karystinos","raw_affiliation_strings":["Department of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece","[Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic and Computer Engineering, Technical University of Crete, Chania, Greece","institution_ids":["https://openalex.org/I55741626"]},{"raw_affiliation_string":"[Dept. of Electron. & Comput. Eng., Tech. Univ. of Crete, Chania]","institution_ids":["https://openalex.org/I142617266"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"a 91","issue":null,"first_page":"1086","last_page":"1090"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.994700014591217,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9721999764442444,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.965499997138977,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.7992681264877319},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6747758388519287},{"id":"https://openalex.org/keywords/quadratic-function","display_name":"Quadratic function","score":0.6311053037643433},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6161949634552002},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5525833368301392},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5110677480697632},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.48837918043136597},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.43704715371131897},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.42232826352119446},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.41866186261177063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3101154565811157},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.21468305587768555},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12920397520065308}],"concepts":[{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.7992681264877319},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6747758388519287},{"id":"https://openalex.org/C166437778","wikidata":"https://www.wikidata.org/wiki/Q50695","display_name":"Quadratic function","level":3,"score":0.6311053037643433},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6161949634552002},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5525833368301392},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5110677480697632},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.48837918043136597},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.43704715371131897},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.42232826352119446},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.41866186261177063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3101154565811157},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.21468305587768555},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12920397520065308},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2008.4558680","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2008.4558680","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 42nd Annual Conference on Information Sciences and Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W57720693","https://openalex.org/W1509805685","https://openalex.org/W1512438637","https://openalex.org/W1965483614","https://openalex.org/W2022244096","https://openalex.org/W2030996579","https://openalex.org/W2037420149","https://openalex.org/W2100210965","https://openalex.org/W2100440346","https://openalex.org/W2120934134","https://openalex.org/W2137082990","https://openalex.org/W2155332825","https://openalex.org/W2157266306","https://openalex.org/W2798333393","https://openalex.org/W4245808720","https://openalex.org/W4293860921","https://openalex.org/W6602383322","https://openalex.org/W6659903690"],"related_works":["https://openalex.org/W269925151","https://openalex.org/W3036464408","https://openalex.org/W2020990755","https://openalex.org/W3096788047","https://openalex.org/W2377851227","https://openalex.org/W2101513891","https://openalex.org/W4293088966","https://openalex.org/W2366868484","https://openalex.org/W4386731488","https://openalex.org/W2364127131"],"abstract_inverted_index":{"The":[0,91],"maximization":[1],"of":[2,26,33,49,81,108,114],"a":[3,8,15,31,55,78,87],"full-rank":[4],"quadratic":[5,57,98],"form":[6,28,58,99],"over":[7],"finite":[9],"alphabet":[10],"is":[11,29,59,75,100,118],"NP-hard":[12],"in":[13,40],"both":[14],"worst-case":[16],"sense":[17],"and":[18,71],"an":[19,63],"average":[20],"sense.":[21],"Interestingly,":[22],"if":[23],"the":[24,27,46,50,72,96,105,112,115],"rank":[25],"not":[30],"function":[32],"it,":[34],"then":[35],"it":[36],"can":[37],"be":[38],"maximized":[39],"polynomial":[41],"time.":[42],"An":[43],"algorithm":[44],"for":[45],"efficient":[47],"computation":[48],"M-phase":[51,89,92],"vector":[52,93],"that":[53,94],"maximizes":[54,95],"rank-deficient":[56,97],"developed":[60],"based":[61],"on":[62],"analytic":[64],"procedure.":[65],"Auxiliary":[66],"hyperspherical":[67],"coordinates":[68],"are":[69],"introduced":[70],"multi-dimensional":[73],"space":[74],"partitioned":[76],"into":[77],"polynomial-size":[79,106],"set":[80,107,117],"regions;":[82],"each":[83],"region":[84],"corresponds":[85],"to":[86,102,104,123],"unique":[88],"vector.":[90],"shown":[101],"belong":[103],"candidate":[109],"vectors.":[110],"Thus,":[111],"size":[113],"feasible":[116],"efficiently":[119],"reduced":[120],"from":[121],"exponential":[122],"polynomial.":[124]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}