{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005051017,0.00008696827,0.0001594878,0.0002296277,0.00009341472,0.0001478538,0.0002580167,0.00003108686,0.00001005608],"category_scores_gemma":[0.0001147703,0.00006445596,0.0000674379,0.0001305677,0.0006641918,0.0005626209,0.0001095724,0.0001492012,8.976081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003346166,"about_ca_system_score_gemma":0.00004613833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008854696,"about_ca_topic_score_gemma":0.00002681841,"domain_scores_codex":[0.9987114,0.0001477345,0.000452467,0.0001216597,0.0004710334,0.00009567237],"domain_scores_gemma":[0.9983196,0.0007226407,0.0004562711,0.0000769326,0.0003829214,0.00004167718],"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.0002436872,0.00005309426,0.004279794,0.000007038529,0.0001082486,0.00001074616,0.0006378638,0.003376781,0.001461652,0.9100031,0.00006072467,0.07975733],"study_design_scores_gemma":[0.002543076,0.0001022196,0.1628608,0.00002978184,0.00001444254,0.0001565054,0.00008174794,0.1206077,0.0005866674,0.7128932,0.00003657303,0.00008738854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3581145,0.0001083238,0.6395515,0.001786241,0.0002434559,0.00007794075,0.000006097001,0.000007626364,0.0001042385],"genre_scores_gemma":[0.988479,0.00002301439,0.01125906,0.00009015464,0.0001322002,0.000001749864,0.00000412164,0.000004050481,0.000006621727],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6303645,"threshold_uncertainty_score":0.2628438,"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."}}