{"id":"W3082438618","doi":"10.4230/lipics.esa.2020.69","title":"On the Computational Complexity of Linear Discrepancy","year":2020,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Mathematics; Matrix (chemical analysis); Computational complexity theory; Exponential function; Constant (computer programming); Row and column spaces; Bounded function; Linear system; Discrete mathematics; Approximation algorithm; Linear programming; Algorithm; Combinatorics; Applied mathematics; Row; Computer science; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.006300354,0.001565328,0.002133683,0.001560843,0.001808212,0.005121471,0.003647489,0.002135457,0.007122512],"category_scores_gemma":[0.0518865,0.0008551731,0.001863447,0.003351532,0.005431519,0.0109724,0.005450433,0.007335403,0.001562789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004277943,"about_ca_system_score_gemma":0.002742968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003776163,"about_ca_topic_score_gemma":0.00270867,"domain_scores_codex":[0.9900786,0.004080425,0.000482984,0.001737455,0.00249793,0.001122662],"domain_scores_gemma":[0.9105515,0.07731304,0.002218429,0.006801123,0.002348321,0.0007675294],"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.002115487,0.0004311503,0.00585105,0.0008650422,0.0001968846,0.0003024274,0.0008532077,0.3835232,0.004715137,0.4949681,0.01993245,0.08624595],"study_design_scores_gemma":[0.00010013,0.00005082716,0.0004882141,0.00004382904,0.00002801601,0.00009007778,0.00008462548,0.6103048,0.00129558,0.385536,0.00195035,0.00002763332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1850479,0.004093717,0.7536659,0.01504554,0.0005002991,0.0002781969,0.001865907,0.002019893,0.03748268],"genre_scores_gemma":[0.7492861,0.002055773,0.2332325,0.001793835,0.0008046722,0.0007557718,0.002211263,0.001051692,0.008808364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007122512,"threshold_uncertainty_score":0.03331989,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1430395375713346,"score_gpt":0.3338956725879022,"score_spread":0.1908561350165676,"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."}}