{"id":"W2143684958","doi":"10.1142/s0218196706003116","title":"TAYLOR TERMS, CONSTRAINT SATISFACTION AND THE COMPLEXITY OF POLYNOMIAL EQUATIONS OVER FINITE ALGEBRAS","year":2006,"lang":"en","type":"article","venue":"International Journal of Algebra and Computation","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"Hungarian Scientific Research Fund","keywords":"Mathematics; Constraint satisfaction problem; Polynomial; Algebra over a field; Complexity of constraint satisfaction; Pure mathematics; Discrete mathematics; Local consistency; 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.003319803,0.0006035279,0.001464784,0.001373658,0.002002897,0.004610668,0.002530825,0.001786563,0.007619266],"category_scores_gemma":[0.02810245,0.0005489254,0.001888011,0.00249288,0.004315468,0.01509075,0.003012585,0.005508652,0.0004862028],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002942926,"about_ca_system_score_gemma":0.002320427,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003310161,"about_ca_topic_score_gemma":0.003389307,"domain_scores_codex":[0.996954,0.0008351006,0.0001813246,0.0005269737,0.0008581278,0.0006444996],"domain_scores_gemma":[0.943981,0.04922445,0.00278896,0.001978515,0.001109543,0.0009175367],"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.0003615867,0.0003474432,0.006297461,0.0004073625,0.0001175954,0.000308159,0.001054824,0.09504974,0.003435334,0.8648851,0.003294596,0.02444079],"study_design_scores_gemma":[0.00004482822,0.00002979643,0.0005788991,0.00001413788,0.00002785163,0.00006509847,0.0001814049,0.1350585,0.001352621,0.861886,0.0007396791,0.00002117154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6381417,0.0008393106,0.3348867,0.007994781,0.0000788047,0.0002349383,0.0009461376,0.0004056367,0.01647195],"genre_scores_gemma":[0.9367484,0.0005902495,0.05684721,0.0003229715,0.0002145631,0.0001516744,0.0011111,0.00008179491,0.003932132],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007619266,"threshold_uncertainty_score":0.02548897,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02582853523826426,"score_gpt":0.3013269032063554,"score_spread":0.2754983679680911,"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."}}