{"id":"W2150782829","doi":"10.1109/tc.2007.19","title":"A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Coding theory and cryptography","field":"Computer Science","cited_by":124,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational complexity theory; Polynomial basis; Multiplier (economics); Mathematics; Discrete mathematics; Matrix multiplication; Toeplitz matrix; Polynomial; Time complexity; Computer science; Algorithm; Combinatorics; Pure mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004612218,0.0002508438,0.0002463534,0.0003948949,0.0003781806,0.0001338026,0.0008747869,0.0001043011,0.00001064763],"category_scores_gemma":[0.000003807218,0.0002587196,0.0002815729,0.0007663849,0.0000621244,0.0002320857,0.000008217944,0.0002363804,0.00003350631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005811463,"about_ca_system_score_gemma":0.00005952968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003738487,"about_ca_topic_score_gemma":0.00003495178,"domain_scores_codex":[0.9983097,0.00006125647,0.0002788559,0.0006175807,0.0002391118,0.0004935325],"domain_scores_gemma":[0.9983891,0.0004439926,0.00005933218,0.0006852931,0.00005230432,0.0003700406],"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.001102617,0.001559082,0.000009620414,0.00009952225,0.0002808274,0.00002191486,0.007334784,0.3392284,0.0009034115,0.1794799,0.01361182,0.4563682],"study_design_scores_gemma":[0.004579772,0.001998162,0.000897723,0.0001354938,0.0000858431,0.00007113809,0.0003861075,0.9436241,0.006543038,0.03409523,0.00597942,0.001603977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002146294,0.000009058229,0.9936925,0.0009750921,0.001372261,0.0006646953,0.000005223062,0.0003835887,0.0007512775],"genre_scores_gemma":[0.4715307,0.000001343925,0.5274986,0.0007259171,0.00005119765,0.0000269349,0.000001243624,0.00001134067,0.000152723],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6043957,"threshold_uncertainty_score":0.9999865,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04373998678267655,"score_gpt":0.2750253196515641,"score_spread":0.2312853328688875,"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."}}