{"id":"W2168788073","doi":"10.1145/1837210.1837227","title":"Parallel sparse polynomial division using heaps","year":2010,"lang":"en","type":"article","venue":"","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Speedup; Division (mathematics); Computer science; Parallel computing; Quotient; Polynomial; Multi-core processor; Parallelism (grammar); Theoretical computer science; Algorithm; Mathematics; Arithmetic; 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.0001466653,0.0001023631,0.000100757,0.00007262183,0.0001377465,0.0001591947,0.0004731185,0.00005347438,0.00006079912],"category_scores_gemma":[0.0000187221,0.00008574875,0.00005507706,0.0001764226,0.0000298774,0.0004591715,0.0002654863,0.0001507618,0.0001218632],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001245484,"about_ca_system_score_gemma":0.00006638681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001849782,"about_ca_topic_score_gemma":0.00004730984,"domain_scores_codex":[0.9991496,0.00002042647,0.0001629367,0.0002741228,0.0001618525,0.0002310348],"domain_scores_gemma":[0.9994432,0.00004471713,0.00004841745,0.0003201771,0.00002757061,0.000115859],"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.00002315398,0.0002791739,0.003065235,0.00001085641,0.00002459075,0.00003399705,0.0007551764,0.003121616,0.221508,0.1929543,0.009456133,0.5687677],"study_design_scores_gemma":[0.0006371282,0.00005905966,0.01517498,0.000007381043,0.000003579965,0.00004019956,0.000006668138,0.9595921,0.006527679,0.008120776,0.009491864,0.0003385574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4739089,0.000006356019,0.5225902,0.0005742135,0.001085673,0.0000555803,3.213876e-7,0.0001376207,0.001641082],"genre_scores_gemma":[0.8549064,4.940696e-7,0.1442952,0.0003202661,0.0002132973,0.000001296193,9.573123e-7,0.000004607747,0.0002574719],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9564705,"threshold_uncertainty_score":0.3496733,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02111897910116239,"score_gpt":0.2573325775597533,"score_spread":0.2362135984585909,"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."}}