{"id":"W102471322","doi":"10.11575/prism/30585","title":"ASYMPTOTICALLY EFFICIENT ALGORITHMS FOR THE FROBENIUS FORM","year":2000,"lang":"en","type":"article","venue":"PRISM (University of Calgary)","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Computation; Algorithm; Matrix (chemical analysis); Asymptotically optimal algorithm; Finite field; Matrix multiplication; Field (mathematics); Computational complexity theory; Invariant (physics); Discrete mathematics; Pure mathematics","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.001107246,0.000798494,0.0008557164,0.001146921,0.0009937624,0.001560508,0.001679755,0.0008996059,0.00813039],"category_scores_gemma":[0.006048141,0.0004781204,0.0008152241,0.0009283206,0.001530696,0.003310465,0.002235151,0.001664841,0.002725877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001808158,"about_ca_system_score_gemma":0.002878879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002214726,"about_ca_topic_score_gemma":0.002947132,"domain_scores_codex":[0.9980835,0.0003844742,0.0001004961,0.0004555065,0.0006787267,0.0002972293],"domain_scores_gemma":[0.9978403,0.00080684,0.0002013057,0.0007145207,0.0003491759,0.00008792582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000532433,0.000193203,0.0009982809,0.0001797327,0.00004307074,0.0001436349,0.0004921719,0.08661079,0.02115097,0.5412529,0.01020121,0.3382016],"study_design_scores_gemma":[0.0001859742,0.0001679495,0.0002613066,0.00003664108,0.00001652662,0.0002078507,0.0001279146,0.552383,0.01781385,0.4198665,0.008879451,0.00005298119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03827672,0.000147395,0.9534653,0.000440202,0.00005203236,0.0001490589,0.0001126579,0.001455142,0.005901502],"genre_scores_gemma":[0.2955447,0.0001719082,0.6937894,0.000124739,0.0001031508,0.0003408191,0.0004252626,0.0003039419,0.00919601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00813039,"threshold_uncertainty_score":0.02719891,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009492412432150656,"score_gpt":0.1910036190265119,"score_spread":0.1815112065943613,"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."}}