{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002133626,0.001243334,0.001724627,0.00154645,0.001469362,0.003436196,0.002987503,0.00237012,0.005302954],"category_scores_gemma":[0.0146472,0.0009691359,0.002013971,0.002926074,0.001746266,0.008758543,0.004010193,0.00223474,0.001761006],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002436525,"about_ca_system_score_gemma":0.004649623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003831382,"about_ca_topic_score_gemma":0.005669147,"domain_scores_codex":[0.9960173,0.0006076543,0.0003919775,0.001340583,0.001085547,0.0005569334],"domain_scores_gemma":[0.9893816,0.007185249,0.0005965419,0.001860823,0.0006791736,0.0002966886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.002265885,0.000556203,0.007246769,0.001229708,0.0002778887,0.0002616223,0.0008242303,0.1856047,0.02575248,0.1134806,0.02735187,0.6351481],"study_design_scores_gemma":[0.0003115495,0.0003349827,0.001580629,0.00004696344,0.0001109922,0.0004256031,0.0002771898,0.7530506,0.01082884,0.2270308,0.005913952,0.00008801852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08647081,0.0007090764,0.8973249,0.001175945,0.00008030667,0.0002662141,0.00116218,0.008069834,0.004740736],"genre_scores_gemma":[0.4655534,0.0003597662,0.5272084,0.0003635306,0.0001422426,0.0003487698,0.003342846,0.0006280066,0.002052982],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005302954,"threshold_uncertainty_score":0.01774019,"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."}}