{"id":"W2141363069","doi":"10.1145/1277548.1277590","title":"Faster algorithms for the characteristic polynomial","year":2007,"lang":"en","type":"article","venue":"","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field (mathematics); Polynomial; Algorithm; Time complexity; Matrix (chemical analysis); Computational complexity theory; Computer science; Discrete mathematics; Mathematics; Pure mathematics; Mathematical analysis","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006043552,0.0000631637,0.00005486787,0.00004373619,0.0001565178,0.0001048961,0.0005599003,0.0000233649,0.0000313088],"category_scores_gemma":[0.00001459112,0.00003816525,0.00007799906,0.0001465107,0.00003368841,0.0001230293,0.00008330867,0.00004709294,0.00002608827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000522957,"about_ca_system_score_gemma":0.000008795928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003502775,"about_ca_topic_score_gemma":0.000003929148,"domain_scores_codex":[0.9994545,0.00001017951,0.0001041523,0.0001488525,0.00007656423,0.000205743],"domain_scores_gemma":[0.9992132,0.0003936913,0.00002677184,0.0003013351,0.00002538273,0.00003968514],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000378043,0.00003351274,0.000173187,0.000003771741,0.00002286743,0.000002707077,0.000467732,8.518563e-7,0.001111612,0.2906261,0.002760553,0.7047593],"study_design_scores_gemma":[0.001810966,0.000634809,0.0660449,0.00002115837,0.00004905354,0.00007537332,0.0003255127,0.06328008,0.01550613,0.0395579,0.8118016,0.0008925961],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004719516,0.00002483525,0.9905193,0.0008782474,0.0007138854,0.0001307228,0.000001187768,0.00009559494,0.002916702],"genre_scores_gemma":[0.9655864,0.000001917159,0.03122055,0.001666467,0.0004006526,0.0000144064,7.339611e-7,0.000005444378,0.001103401],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9608669,"threshold_uncertainty_score":0.1556334,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02456361384098206,"score_gpt":0.2674965414592743,"score_spread":0.2429329276182922,"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."}}