{"id":"W2087012565","doi":"10.2178/jsl/1203350791","title":"Consequences of the provability of <i>NP</i> ⊆ <i>P</i>/<i>poly</i>","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Logic","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Hierarchy; Polynomial hierarchy; Mathematics; Combinatorics; Time complexity; P versus NP problem; Polynomial; Discrete mathematics; Computational complexity theory; Algorithm","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.004829844,0.000456063,0.0006028885,0.001136114,0.002968576,0.003650293,0.001835061,0.001486064,0.008770843],"category_scores_gemma":[0.02866378,0.0007383617,0.001333376,0.0007513343,0.007456217,0.007864632,0.004189718,0.005457566,0.0006830849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002018902,"about_ca_system_score_gemma":0.001757128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002446041,"about_ca_topic_score_gemma":0.002326662,"domain_scores_codex":[0.9936683,0.001603252,0.000379899,0.0009338428,0.001969939,0.001444878],"domain_scores_gemma":[0.9372201,0.04840246,0.002582133,0.004000338,0.005286145,0.002508889],"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.0006476163,0.0003779309,0.006042557,0.000462007,0.0001435848,0.002763435,0.001593319,0.007859513,0.01366541,0.9346552,0.00970693,0.02208259],"study_design_scores_gemma":[0.0002007982,0.0001570138,0.004334128,0.0000935491,0.0001067574,0.001029707,0.001050924,0.02379804,0.0250147,0.9348527,0.009283664,0.00007799119],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5140052,0.0006254839,0.2933957,0.01248918,0.0007068604,0.0005824026,0.001379151,0.003563811,0.1732523],"genre_scores_gemma":[0.9750912,0.0002001734,0.02069918,0.0009166394,0.0002196777,0.0001238695,0.0003906115,0.000211921,0.002146774],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.008770843,"threshold_uncertainty_score":0.0293414,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02375080234186978,"score_gpt":0.2625584848825566,"score_spread":0.2388076825406868,"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."}}