{"id":"W4320487114","doi":"10.1137/18m1233418","title":"Inapproximability of Matrix \\(\\boldsymbol{p \\rightarrow q}\\) Norms","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Simons Institute for the Theory of Computing, University of California Berkeley; National Science Foundation","keywords":"Mathematics; Combinatorics; Hardness of approximation; Approximation algorithm; Exponential time hypothesis; Matrix (chemical analysis); Norm (philosophy); Matrix norm; Exponential function; Constant (computer programming); Discrete mathematics; Time complexity; Computer science; Physics; Eigenvalues and eigenvectors; Quantum mechanics; Mathematical analysis","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.001872952,0.0001983161,0.0003538172,0.0004350354,0.0004605155,0.0001916255,0.001411171,0.0000741036,0.00002306628],"category_scores_gemma":[0.0001407323,0.0001638028,0.0002573056,0.001610931,0.0001079898,0.0003133975,0.0004903867,0.0006350769,0.00008851058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006102742,"about_ca_system_score_gemma":0.000104102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000763306,"about_ca_topic_score_gemma":0.000001127447,"domain_scores_codex":[0.997647,0.0001656387,0.0006449576,0.0003662232,0.0006722194,0.0005039847],"domain_scores_gemma":[0.9982796,0.000431443,0.0003674882,0.0005547813,0.0001894848,0.0001772555],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007777886,0.0008492279,0.01180127,0.0003148089,0.0002250606,0.0006103705,0.005240085,0.02563768,0.002387557,0.3861063,0.007663649,0.5590862],"study_design_scores_gemma":[0.001345515,0.0007180666,0.03836648,0.0004109604,0.0000133436,0.000531832,0.0002118175,0.7646762,0.003868993,0.1842785,0.004947029,0.0006312769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6731549,0.000132135,0.3190646,0.001786447,0.002884912,0.0001856204,0.000003771091,0.0004630204,0.002324657],"genre_scores_gemma":[0.954082,0.00001791741,0.04532983,0.0001174931,0.0003534322,8.313839e-7,0.000001309653,0.00001291085,0.00008423315],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7390385,"threshold_uncertainty_score":0.6679683,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02354846363361499,"score_gpt":0.2929863234056024,"score_spread":0.2694378597719874,"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."}}