{"id":"W2132910148","doi":"10.1109/sct.1989.41812","title":"On the theory of average case complexity","year":2003,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Complexity class; Nondeterministic algorithm; Time complexity; NP; Mathematics; Computational complexity theory; Structural complexity theory; Equivalence (formal languages); PH; Average-case complexity; PSPACE; Exponential function; Polynomial hierarchy; Hierarchy; Discrete mathematics; Descriptive complexity theory; Time hierarchy theorem; Counting problem; Context (archaeology); Quantum complexity theory; Algorithm; Turing machine; Computation","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.003963733,0.001042394,0.00170639,0.003049318,0.0020193,0.005550125,0.002275421,0.001687355,0.02166944],"category_scores_gemma":[0.01345113,0.0006686902,0.001664907,0.005978071,0.006428632,0.01458821,0.003537856,0.007289844,0.003482357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00529736,"about_ca_system_score_gemma":0.001775067,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002663684,"about_ca_topic_score_gemma":0.001584522,"domain_scores_codex":[0.9962368,0.001178204,0.0001915252,0.0008090303,0.001199304,0.0003851523],"domain_scores_gemma":[0.9731621,0.02199074,0.0006356164,0.001996055,0.001638413,0.0005770761],"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.00001098395,0.0000168088,0.0001409465,0.0001257174,0.00002060575,0.00003753485,0.00006742717,0.004247334,0.00006989493,0.9703554,0.01127752,0.01362984],"study_design_scores_gemma":[0.000002810599,0.000003951827,0.00008276159,0.00002709297,0.000006126315,0.0000246311,0.00001320807,0.003639572,0.00003395444,0.9896242,0.006536763,0.000004982597],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01837819,0.02850752,0.5643306,0.03291263,0.002005166,0.0001182766,0.001302196,0.0009079539,0.3515374],"genre_scores_gemma":[0.6896986,0.04681928,0.1714819,0.01172825,0.0147775,0.001004112,0.002981127,0.0008515555,0.06065769],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02166944,"threshold_uncertainty_score":0.07249153,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05982840385805717,"score_gpt":0.2556288796402041,"score_spread":0.195800475782147,"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."}}