{"id":"W247221977","doi":"10.1145/780591.780595","title":"Derandomizing polynomial identity tests means proving circuit lower bounds","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Nondeterministic algorithm; Polynomial; Discrete mathematics; Corollary; Arithmetic circuit complexity; Combinatorics; Identity (music); 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":[],"consensus_categories":[],"category_scores_codex":[0.0006700033,0.0001675351,0.000208715,0.0001353226,0.0004110979,0.0007163871,0.0008427029,0.00005905913,0.0001357403],"category_scores_gemma":[0.0001965214,0.0001586298,0.000151895,0.0005213759,0.00007617849,0.001473936,0.0001931126,0.0001837551,0.00007122723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000567782,"about_ca_system_score_gemma":0.0001277177,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001171724,"about_ca_topic_score_gemma":0.0002397051,"domain_scores_codex":[0.9983925,0.0001052615,0.0002713857,0.0004478603,0.000357175,0.0004257856],"domain_scores_gemma":[0.999005,0.0001664006,0.00006805442,0.000563548,0.00007148276,0.0001254799],"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.00001331056,0.0002418268,0.002711584,0.00002191526,0.00004987256,0.00005790963,0.0006941608,0.00004349493,0.001588217,0.9680805,0.002193608,0.02430362],"study_design_scores_gemma":[0.02156349,0.0006624695,0.01792096,0.0002465772,0.0001065608,0.0008830607,0.0003973378,0.1103646,0.02079968,0.7003422,0.1223725,0.00434045],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02606983,0.0001148357,0.9205413,0.0001813674,0.001494627,0.0001987175,8.377349e-7,0.0003194908,0.05107898],"genre_scores_gemma":[0.9348503,0.000005302087,0.06354721,0.0005198036,0.0001132246,0.00001267381,5.034347e-7,0.00001077883,0.0009401785],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9087805,"threshold_uncertainty_score":0.6908138,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02633774209728651,"score_gpt":0.2543340318390336,"score_spread":0.2279962897417471,"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."}}