{"id":"W2089329646","doi":"10.1016/s0167-6377(00)00059-6","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Oracle; Linear programming; Mathematics; Polynomial; Convergence (economics); Time complexity; Algorithm; Construct (python library); Computer science; Mathematical optimization; Discrete mathematics","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.004551914,0.001771068,0.003505613,0.001020322,0.002039658,0.007195709,0.004233995,0.002773241,0.01842681],"category_scores_gemma":[0.03835203,0.001100544,0.002061439,0.002057297,0.003667364,0.02226455,0.00422103,0.007077055,0.002778408],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002718585,"about_ca_system_score_gemma":0.003115453,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073133,"about_ca_topic_score_gemma":0.001545317,"domain_scores_codex":[0.9922043,0.001461043,0.0004231299,0.002206163,0.002032843,0.00167249],"domain_scores_gemma":[0.9361299,0.04391602,0.004098445,0.01015291,0.003230154,0.002472493],"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.007261362,0.0009989283,0.007977693,0.001713735,0.0003549276,0.0005322589,0.000664016,0.06682755,0.03051111,0.6749957,0.03425476,0.1739079],"study_design_scores_gemma":[0.0002715939,0.0002786297,0.001733481,0.00006975116,0.0001630461,0.00102187,0.0001953177,0.1344766,0.02112082,0.8331754,0.007407538,0.00008604941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3184021,0.001845948,0.5807339,0.01444716,0.0006668863,0.0002666501,0.002865443,0.005486936,0.075285],"genre_scores_gemma":[0.8927202,0.0008941451,0.08257765,0.00176719,0.0008490118,0.0001932228,0.002482197,0.001402501,0.01711397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01842681,"threshold_uncertainty_score":0.06164378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07014629511236242,"score_gpt":0.3576475601690094,"score_spread":0.287501265056647,"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."}}