{"id":"W2279788372","doi":"10.1145/2996450","title":"A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets","year":2017,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France; Canada Research Chairs; Agence Nationale de la Recherche","keywords":"Bounded function; Intersection (aeronautics); Dimension (graph theory); Time complexity; Algorithm; Algebraic number; Set (abstract data type); Real algebraic geometry; Polynomial; Mathematics; Running time; Computer science; Discrete mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.0006486907,0.00007720906,0.0001694516,0.00005610304,0.0003606009,0.0004772676,0.001616455,0.00003289864,5.593382e-7],"category_scores_gemma":[0.00086153,0.00005293725,0.00007885219,0.00005120873,0.00007231632,0.0008774882,0.0007472737,0.0001321308,3.50222e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004627977,"about_ca_system_score_gemma":0.0001209955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001073348,"about_ca_topic_score_gemma":0.0000656771,"domain_scores_codex":[0.9993204,0.00005272519,0.0002091991,0.0001178992,0.0001477494,0.0001520638],"domain_scores_gemma":[0.9986756,0.0002636309,0.0004071039,0.000533851,0.00006558171,0.00005417565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.00008061954,0.00007694381,0.00648704,0.00001490273,0.00005203704,0.00003270654,0.002504783,0.0001012175,0.001567084,0.01031705,0.0007819749,0.9779837],"study_design_scores_gemma":[0.002228876,0.0003602656,0.5359316,0.0001375685,0.00001937463,0.0002500036,0.00006955702,0.1363377,0.003327599,0.3204225,0.0007005036,0.0002144535],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9059348,0.00006453147,0.08800521,0.005304867,0.0005600155,0.00008761662,0.000001474474,0.000006834914,0.0000346183],"genre_scores_gemma":[0.8792531,0.00001390898,0.1204891,0.00008302084,0.0001331986,0.000001742807,6.147899e-8,0.000004028878,0.00002179759],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9777692,"threshold_uncertainty_score":0.4602303,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02475850701117695,"score_gpt":0.2885164726401233,"score_spread":0.2637579656289463,"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."}}