{"id":"W1991405149","doi":"10.1090/s0025-5718-00-01246-1","title":"A polynomial-time complexity bound for the computation of the singular part of a Puiseux expansion of an algebraic function","year":2000,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Algebraic function; Algebraic number; Rational function; Function field of an algebraic variety; Polynomial; Logarithm; Newton polygon; Function (biology); Real algebraic geometry; Field (mathematics); Algebraic surface; Singular point of an algebraic variety; Algebraic extension; Power series; Algebraic element; Upper and lower bounds; Pure mathematics; Discrete mathematics; 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.0008181677,0.0001205078,0.0002985435,0.00009760517,0.0001377127,0.00002751852,0.0004755167,0.00005026599,0.00001491678],"category_scores_gemma":[0.00005141895,0.00008527529,0.0001941126,0.0004555912,0.0002607882,0.0002087452,0.00006009565,0.00005330145,0.000001087363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001048399,"about_ca_system_score_gemma":0.00005544587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001566257,"about_ca_topic_score_gemma":0.000002778298,"domain_scores_codex":[0.9985714,0.0001489803,0.0006470726,0.0001643168,0.0003534742,0.0001147619],"domain_scores_gemma":[0.9980406,0.0005455257,0.0006952322,0.0004172039,0.0002771568,0.00002423883],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007627998,0.002704085,0.0001545881,0.002362937,0.0004971311,3.937166e-7,0.02618737,0.1769376,0.06891166,0.2288281,0.000812758,0.4918406],"study_design_scores_gemma":[0.0005156751,0.0004488577,0.001758031,0.0001789525,0.00007852977,0.000002629342,0.0001211532,0.7332245,0.01328466,0.2502644,0.00003405428,0.00008857237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.52448,0.00003321803,0.4748885,0.00006406744,0.00008140172,0.0003413368,0.000006105112,0.00001870793,0.00008668697],"genre_scores_gemma":[0.9497571,0.000001600399,0.05016292,0.00001993213,0.00002126799,0.000009254461,0.000008460472,0.0000089743,0.00001051168],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5562869,"threshold_uncertainty_score":0.3477425,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02686176452219246,"score_gpt":0.2551159990401332,"score_spread":0.2282542345179407,"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."}}