{"id":"W1985924702","doi":"10.1016/j.jsc.2013.03.004","title":"On the complexity of the generalized MinRank problem","year":2013,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Institut Universitaire de France; Agence Nationale de la Recherche","keywords":"Mathematics; Rank (graph theory); Bounded function; Computational complexity theory; Polynomial; Matrix (chemical analysis); Ideal (ethics); Variety (cybernetics); Discrete mathematics; Representation (politics); Algebraic number; Algebra over a field; Combinatorics; Algorithm; 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.002337298,0.001103578,0.002369239,0.001481755,0.002057161,0.006614951,0.002888037,0.002449201,0.01912795],"category_scores_gemma":[0.02073916,0.0006432137,0.001457207,0.002832532,0.003648761,0.01576743,0.003770524,0.004612048,0.001654078],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002717564,"about_ca_system_score_gemma":0.002566688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00343304,"about_ca_topic_score_gemma":0.004648471,"domain_scores_codex":[0.9965101,0.001107938,0.0001598518,0.0006026232,0.0009772892,0.0006421088],"domain_scores_gemma":[0.9765595,0.01899292,0.001150517,0.001762426,0.0008745615,0.0006601691],"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.0008911971,0.0002579833,0.002447698,0.0005157755,0.0001115767,0.0003143153,0.0005644181,0.08145178,0.001711702,0.847187,0.01955597,0.04499066],"study_design_scores_gemma":[0.00006657338,0.00002353135,0.0002957388,0.00001941095,0.00001944934,0.00007742395,0.00008826877,0.0740661,0.0003116418,0.9237812,0.001231349,0.00001920593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.559119,0.004000023,0.2867317,0.02366892,0.0007127692,0.0002550562,0.002998765,0.001171866,0.1213417],"genre_scores_gemma":[0.9379395,0.001431597,0.04186559,0.0009403544,0.0009447157,0.0001916892,0.00184373,0.0003732865,0.01446957],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01912795,"threshold_uncertainty_score":0.0639894,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03037903373116636,"score_gpt":0.2429758271014958,"score_spread":0.2125967933703294,"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."}}