{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004160213,0.002084447,0.001823672,0.001057286,0.001168576,0.004769187,0.003411282,0.003051091,0.0065402],"category_scores_gemma":[0.02940404,0.0006571618,0.001375106,0.00196046,0.003605415,0.007245073,0.003431131,0.00510782,0.00211855],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002291859,"about_ca_system_score_gemma":0.002134882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001817432,"about_ca_topic_score_gemma":0.001523477,"domain_scores_codex":[0.9946786,0.001966302,0.00023268,0.001299924,0.001121613,0.0007009217],"domain_scores_gemma":[0.9720044,0.02224715,0.001808231,0.001480895,0.00156407,0.0008952679],"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.001319012,0.0005809544,0.002790845,0.001348547,0.000259856,0.0003349877,0.0006707001,0.2295961,0.004077408,0.6140524,0.04128568,0.1036836],"study_design_scores_gemma":[0.0001037614,0.0001619204,0.0002146177,0.00007571704,0.00003144596,0.0001834938,0.000127915,0.4369791,0.002735192,0.5564162,0.002938817,0.00003184022],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.268516,0.006836442,0.6663095,0.01285404,0.0009994693,0.0002838914,0.002594655,0.002481051,0.03912494],"genre_scores_gemma":[0.8167973,0.00190942,0.1568065,0.002151808,0.001304819,0.0004867377,0.003402153,0.0007209141,0.01642041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0065402,"threshold_uncertainty_score":0.02200156,"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."}}