{"id":"W2107482418","doi":"10.1016/j.jco.2014.09.004","title":"A deterministic algorithm for inverting a polynomial matrix","year":2014,"lang":"en","type":"article","venue":"Journal of Complexity","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Exponent; Matrix multiplication; Inverse; Univariate; Matrix (chemical analysis); Polynomial matrix; Invariant (physics); Combinatorics; Upper and lower bounds; Field (mathematics); Polynomial; Discrete mathematics; Algorithm; Matrix polynomial; Pure mathematics; Mathematical analysis; Statistics; Geometry","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.0007942534,0.001590131,0.001205384,0.0007835695,0.001601532,0.002082217,0.002383912,0.001972993,0.01368762],"category_scores_gemma":[0.004005717,0.0009115118,0.001658458,0.001327927,0.001252933,0.003220951,0.0036641,0.002631909,0.004535016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00144573,"about_ca_system_score_gemma":0.004075497,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003006485,"about_ca_topic_score_gemma":0.007630058,"domain_scores_codex":[0.9978579,0.0002183045,0.0001510746,0.0006973198,0.0007453597,0.0003300663],"domain_scores_gemma":[0.9971449,0.001106386,0.0001659546,0.0009657227,0.0004553667,0.0001616523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001154052,0.0006373122,0.002153022,0.0006104338,0.0002265534,0.0003748506,0.0003687016,0.04268704,0.04586951,0.1208926,0.02548043,0.7595455],"study_design_scores_gemma":[0.0009803532,0.000619615,0.001518273,0.0000959321,0.0002733236,0.001061073,0.0002707322,0.6283372,0.05677649,0.2844313,0.02544041,0.0001952599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02221555,0.000196839,0.9640355,0.0005738118,0.0001877268,0.0002235067,0.0003708514,0.004448613,0.007747572],"genre_scores_gemma":[0.2393091,0.0001769079,0.7451678,0.0003547115,0.0001411268,0.0003930759,0.001157826,0.0004247504,0.01287469],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01368762,"threshold_uncertainty_score":0.0457896,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03252501886350941,"score_gpt":0.2923396275986458,"score_spread":0.2598146087351364,"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."}}