{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003774632,0.0009896524,0.001611449,0.001087533,0.001476573,0.005438979,0.002702468,0.001454117,0.004302208],"category_scores_gemma":[0.01625077,0.000712684,0.00204864,0.001499351,0.004322527,0.0106475,0.003907254,0.004448303,0.0007153295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00350116,"about_ca_system_score_gemma":0.002511174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001313202,"about_ca_topic_score_gemma":0.001276945,"domain_scores_codex":[0.9934036,0.001986453,0.0003451927,0.001465424,0.00149079,0.001308463],"domain_scores_gemma":[0.9664949,0.0228727,0.00203426,0.006826992,0.000822309,0.0009489021],"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.0002365328,0.00004860581,0.000859552,0.0001252174,0.00005125959,0.00009199735,0.0002169051,0.08258239,0.002622549,0.9017333,0.001364693,0.01006689],"study_design_scores_gemma":[0.00005967473,0.00006112969,0.0003262046,0.00001744029,0.00003625145,0.000111749,0.00004282155,0.2450985,0.002500197,0.7488225,0.00289624,0.00002733492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2064987,0.0006668122,0.753258,0.003418315,0.00006143849,0.0001867041,0.0007086978,0.001508608,0.03369278],"genre_scores_gemma":[0.9328526,0.0004869777,0.05905851,0.000320184,0.0001714131,0.0003119824,0.0004163173,0.0002430241,0.006139006],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005438979,"threshold_uncertainty_score":0.02540284,"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."}}