{"id":"W2949595835","doi":"10.48550/arxiv.0707.2347","title":"Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm","year":2007,"lang":"en","type":"preprint","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Strassen algorithm; Matrix multiplication; Multiplication algorithm; Computer science; Scheduling (production processes); Multiplication (music); Matrix (chemical analysis); Constant (computer programming); Algorithm; Arithmetic; Mathematics; Mathematical optimization; Combinatorics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004751031,0.0007523122,0.0008184438,0.0005512147,0.0007468741,0.0008140416,0.001847332,0.0004557267,0.005432593],"category_scores_gemma":[0.00109944,0.0003617344,0.0004052899,0.0008451737,0.0006059209,0.0009525143,0.0007775264,0.0006531722,0.001180714],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001076655,"about_ca_system_score_gemma":0.001801556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004212984,"about_ca_topic_score_gemma":0.0068068,"domain_scores_codex":[0.999467,0.0001434555,0.00003577377,0.00007266665,0.0001310061,0.0001501727],"domain_scores_gemma":[0.9995348,0.0001015074,0.00003946924,0.0001422221,0.0001267189,0.00005538225],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001189325,0.0002813006,0.0008562214,0.0003280024,0.00008803012,0.0003532643,0.0005298087,0.4451393,0.04073269,0.1786485,0.01355227,0.3183013],"study_design_scores_gemma":[0.0001682286,0.0002082362,0.0002554222,0.00001476401,0.00002838086,0.00009532077,0.0000605965,0.9221115,0.02402912,0.04142701,0.01155892,0.0000425055],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08739273,0.0003365432,0.9002265,0.0001957689,0.0001243542,0.0001297493,0.0001121382,0.001337126,0.01014509],"genre_scores_gemma":[0.4834832,0.0002538651,0.5049869,0.000086637,0.00004737831,0.0002142922,0.0003179793,0.0003366645,0.01027305],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005432593,"threshold_uncertainty_score":0.01817387,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02053359651592145,"score_gpt":0.3081984710519494,"score_spread":0.2876648745360279,"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."}}