{"id":"W4389477517","doi":"10.1007/s10208-023-09637-4","title":"Computational Complexity of Decomposing a Symmetric Matrix as a Sum of Positive Semidefinite and Diagonal Matrices","year":2023,"lang":"en","type":"article","venue":"Foundations of Computational Mathematics","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Rank (graph theory); Matrix (chemical analysis); Positive-definite matrix; Diagonal; Combinatorics; Diagonal matrix; Semidefinite programming; Symmetric matrix; Polynomial matrix; Bounded function; Matrix polynomial; Matrix decomposition; Computational complexity theory; Polynomial; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Eigenvalues and eigenvectors","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002256258,0.001053508,0.001213635,0.0007251,0.0007460802,0.003399238,0.001537252,0.001187659,0.01193013],"category_scores_gemma":[0.01575858,0.0006348211,0.0008756162,0.001301892,0.001392597,0.00486006,0.00254723,0.002875516,0.001590506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001599645,"about_ca_system_score_gemma":0.003461665,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004565184,"about_ca_topic_score_gemma":0.008810288,"domain_scores_codex":[0.9971263,0.0009265947,0.0001430414,0.0004223531,0.001059864,0.0003220138],"domain_scores_gemma":[0.9799382,0.01704614,0.0005625089,0.001048647,0.000978875,0.0004255711],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001803245,0.000475,0.003455086,0.0006289296,0.0001698885,0.0006301712,0.000342919,0.6392474,0.01117124,0.1000731,0.02558574,0.2164173],"study_design_scores_gemma":[0.00008931882,0.00007921952,0.0004844912,0.0000161198,0.00001995621,0.0001292761,0.0001127747,0.9515569,0.001507003,0.04525705,0.0007315385,0.00001637729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1540176,0.001003799,0.8083563,0.008549064,0.0004675001,0.0003092174,0.001997036,0.001507141,0.02379231],"genre_scores_gemma":[0.7211984,0.0007546623,0.2617446,0.0008078042,0.0005734959,0.0004343947,0.00214746,0.0004857577,0.01185334],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01193013,"threshold_uncertainty_score":0.03991032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03505159384007851,"score_gpt":0.3077297506518258,"score_spread":0.2726781568117473,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}