{"id":"W2088713140","doi":"10.1016/j.jsc.2012.05.008","title":"On the complexity of computing with zero-dimensional triangular sets","year":2012,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"ca_institutions":"Western University","funders":"Agence Nationale de la Recherche","keywords":"Mathematics; Modular design; Degree (music); Dimension (graph theory); Inverse; Zero (linguistics); Las vegas; Field (mathematics); Algebraic number; Computation; Finite field; Set (abstract data type); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","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.000991598,0.0001395651,0.0002894087,0.0001834976,0.0001442574,0.00005268009,0.0003939047,0.00003596513,0.000007459572],"category_scores_gemma":[0.0000691842,0.00008526184,0.0001128804,0.0004118767,0.0001303868,0.0004053037,0.00008930827,0.0002139476,0.000008278716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005208956,"about_ca_system_score_gemma":0.0001084545,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001054267,"about_ca_topic_score_gemma":5.977621e-7,"domain_scores_codex":[0.9982944,0.0002043579,0.0005492032,0.0001164613,0.000609589,0.0002259835],"domain_scores_gemma":[0.9980109,0.0005876872,0.0008303512,0.0001584461,0.0002985088,0.0001140914],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003692749,0.001244871,0.00212666,0.00007462643,0.0003915663,0.00002841106,0.01228858,0.1762193,0.003158739,0.6202857,0.004634327,0.1791778],"study_design_scores_gemma":[0.00355246,0.001552655,0.208925,0.0005072457,0.00008488681,0.000896884,0.0002033094,0.6154872,0.0059358,0.1621951,0.0001565467,0.0005029395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6033478,0.00006372345,0.3949239,0.001111055,0.0003259214,0.00008745116,7.848908e-7,0.00001470429,0.0001245871],"genre_scores_gemma":[0.9765868,8.691401e-7,0.02290961,0.0003224266,0.000166058,4.973762e-7,0.000001668291,0.000007298899,0.000004784595],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4580907,"threshold_uncertainty_score":0.3476877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03761755709077252,"score_gpt":0.2682194969239669,"score_spread":0.2306019398331944,"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."}}