{"id":"W172422417","doi":"","title":"Polynomial Time with Restricted Use of Randomness","year":2009,"lang":"en","type":"article","venue":"Electronic colloquium on computational complexity","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Randomness; Turing machine; Time complexity; Focus (optics); Hierarchy; Computer science; Stack (abstract data type); Polynomial hierarchy; Computation; Time hierarchy theorem; Binary logarithm; DTIME; Discrete mathematics; Random number generation; PSPACE; Theoretical computer science; Mathematics; Algorithm; Computational complexity theory; Universal Turing machine; Statistics","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.0002553904,0.0003139047,0.0004883913,0.0003497225,0.0003163395,0.0001777918,0.0009227353,0.00007415708,0.00006500423],"category_scores_gemma":[0.00006087243,0.0002886347,0.0001621771,0.001481746,0.0002292989,0.0004958354,0.0001137651,0.000380045,0.00002548015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001879924,"about_ca_system_score_gemma":0.0006232584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004440882,"about_ca_topic_score_gemma":0.0000213396,"domain_scores_codex":[0.997216,0.0002151398,0.0004865695,0.0006117116,0.0008430376,0.0006274849],"domain_scores_gemma":[0.9979414,0.0007091219,0.0002769142,0.0005803923,0.0003529228,0.0001392669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002978732,0.001627722,0.0001732748,0.00001732291,0.0002209321,0.00004173015,0.0002634248,0.07432887,0.0008958659,0.8845422,0.0120758,0.0228341],"study_design_scores_gemma":[0.007892749,0.005416599,0.0630618,0.00009329159,0.00003899058,0.0001495275,0.000005954333,0.72541,0.00105638,0.1859062,0.009975722,0.0009927509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3473099,0.0001051981,0.6432467,0.004265829,0.0002495873,0.001104574,0.00006400563,0.0006314967,0.003022678],"genre_scores_gemma":[0.9560227,0.000003509862,0.04296843,0.000658159,0.0000792304,0.00001103753,0.00005645116,0.00001216948,0.0001882529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6986361,"threshold_uncertainty_score":0.9999566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02529183199500784,"score_gpt":0.2433837459703609,"score_spread":0.2180919139753531,"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."}}