{"id":"W4239112803","doi":"10.1137/1.9781611974331.ch84","title":"Improved Deterministic Algorithms for Linear Programming in Low Dimensions","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Linear programming; Upper and lower bounds; Algorithm; Mathematics; Combinatorics; Time complexity; Sampling (signal processing); Running time; Deterministic algorithm; Discrete mathematics; Computer science; Mathematical analysis; Telecommunications","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.004325667,0.001501536,0.00166887,0.001249114,0.001275932,0.002174713,0.003502814,0.001657606,0.005890287],"category_scores_gemma":[0.02098999,0.001238824,0.002088745,0.002266274,0.002290074,0.003837203,0.003537555,0.005646929,0.001926974],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004089905,"about_ca_system_score_gemma":0.003100821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005830332,"about_ca_topic_score_gemma":0.009576285,"domain_scores_codex":[0.993299,0.002470412,0.0003776458,0.001277626,0.001881151,0.0006941784],"domain_scores_gemma":[0.988786,0.006994031,0.0004087182,0.002631742,0.0009462151,0.0002334812],"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.0007214754,0.0003075484,0.001599841,0.0004069795,0.0001666439,0.00009430103,0.0002747845,0.2945364,0.00703329,0.5154175,0.0212987,0.1581426],"study_design_scores_gemma":[0.000223738,0.00008919615,0.000319502,0.00002876535,0.00003422162,0.00004696516,0.00002598079,0.7362169,0.002727324,0.2499952,0.01025584,0.00003627971],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01526822,0.001116073,0.9711351,0.001440056,0.0002161237,0.0001476269,0.0002740906,0.001699333,0.008703227],"genre_scores_gemma":[0.207185,0.0007496625,0.7804471,0.001177166,0.000353058,0.0008449881,0.001139218,0.0007205918,0.007383242],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005890287,"threshold_uncertainty_score":0.02967447,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1299207435586148,"score_gpt":0.4200409554620417,"score_spread":0.2901202119034269,"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."}}