{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002227715,0.001673163,0.00165377,0.002225648,0.001242482,0.002842931,0.002891324,0.001974878,0.01960207],"category_scores_gemma":[0.01076276,0.0008351097,0.001639224,0.002245371,0.001535528,0.009691102,0.003323467,0.003644217,0.004932735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002826544,"about_ca_system_score_gemma":0.00311978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003395388,"about_ca_topic_score_gemma":0.004572616,"domain_scores_codex":[0.9955016,0.0008414323,0.0001785163,0.001220672,0.001643123,0.0006146905],"domain_scores_gemma":[0.9925039,0.002931914,0.0006006681,0.002845022,0.000877065,0.0002414395],"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.001135068,0.0004940467,0.001507984,0.0004688746,0.000169065,0.0002176991,0.0003459186,0.1005458,0.03587182,0.3748383,0.03146757,0.452938],"study_design_scores_gemma":[0.0006525186,0.0002778439,0.0005579891,0.00007048199,0.00006504224,0.0003525804,0.00008488262,0.674496,0.01619221,0.2860394,0.0210965,0.0001145126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01941255,0.0006177328,0.9671783,0.0008864925,0.0002622054,0.0001718501,0.0001850761,0.005695219,0.005590622],"genre_scores_gemma":[0.2721797,0.0005705365,0.7123951,0.0004810682,0.0004613954,0.0004547349,0.0009238875,0.000959789,0.01157378],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01960207,"threshold_uncertainty_score":0.06557542,"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."}}