{"id":"W2026036943","doi":"10.1007/s00037-004-0182-6","title":"Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds","year":2004,"lang":"en","type":"article","venue":"Computational Complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":384,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Polynomial; Arithmetic circuit complexity; Combinatorics; Nondeterministic algorithm; Discrete mathematics; Bounded function; Identity (music); Degree (music); Upper and lower bounds; Arithmetic; Arbitrary-precision arithmetic","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.01121547,0.003161337,0.0040759,0.002569047,0.003537974,0.009421405,0.009121137,0.005902006,0.01670546],"category_scores_gemma":[0.1016763,0.002284436,0.005622747,0.003682809,0.01241993,0.02525092,0.01391639,0.01946206,0.003557791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.007584944,"about_ca_system_score_gemma":0.006049356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002344676,"about_ca_topic_score_gemma":0.002917585,"domain_scores_codex":[0.9723041,0.01087232,0.001073435,0.005968978,0.005630726,0.004150483],"domain_scores_gemma":[0.7276943,0.2354011,0.003436155,0.02558283,0.005453487,0.002432057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001336877,0.0006862612,0.00385777,0.0009436024,0.0002680207,0.0003014616,0.0008564426,0.07379137,0.006289975,0.8242863,0.02035287,0.06702907],"study_design_scores_gemma":[0.0001431807,0.00008412386,0.0003647086,0.00006580207,0.0001206004,0.0001192292,0.0001356754,0.1074015,0.008317246,0.8796413,0.003561433,0.00004522394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1022752,0.001231065,0.8325782,0.01568997,0.0009170226,0.0004763764,0.00132583,0.003026344,0.04248005],"genre_scores_gemma":[0.8415281,0.001424141,0.1312929,0.005365496,0.001629935,0.0008100466,0.002250286,0.002182998,0.01351606],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01670546,"threshold_uncertainty_score":0.05931377,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05471051344573013,"score_gpt":0.2880086850664225,"score_spread":0.2332981716206923,"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."}}