{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006420803,0.0003296811,0.000402633,0.0002684023,0.001035046,0.0008355961,0.001586326,0.0000882833,0.00005390993],"category_scores_gemma":[0.0001541225,0.0003623221,0.0002817445,0.0008629819,0.0003925197,0.001857955,0.0006682646,0.0003897944,0.0001280687],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002959656,"about_ca_system_score_gemma":0.0004415357,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002594743,"about_ca_topic_score_gemma":0.000248667,"domain_scores_codex":[0.9970379,0.0001355182,0.0005687674,0.0007825448,0.0009016008,0.0005736828],"domain_scores_gemma":[0.9983326,0.000326275,0.0002134126,0.0005777249,0.0003169045,0.0002330866],"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.0000453432,0.0004069624,0.0007183254,0.00003632054,0.00007025687,0.00006193924,0.0007050977,0.04093824,0.0001459951,0.9510143,0.000335784,0.005521367],"study_design_scores_gemma":[0.00314183,0.0000997575,0.03452035,0.00005506076,0.00001245829,0.0001286986,0.00001474195,0.08973329,0.00007094455,0.8711692,0.0005741602,0.0004794933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1038046,0.0001099379,0.8906953,0.001142936,0.001165124,0.0003394833,0.00001898069,0.000485013,0.002238702],"genre_scores_gemma":[0.8217263,0.000001422394,0.17721,0.0006852092,0.0002864938,0.00001853,0.00002821028,0.00001733624,0.00002651182],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7179217,"threshold_uncertainty_score":0.9998829,"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."}}