{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001174682,0.0002060159,0.0002322607,0.000245319,0.001784426,0.00102537,0.001171769,0.0001020554,0.000103727],"category_scores_gemma":[0.0001259757,0.0002119069,0.0001818497,0.0006247808,0.0002299883,0.00056079,0.0001497408,0.0003946463,0.00003070277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001465702,"about_ca_system_score_gemma":0.0003597222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007700888,"about_ca_topic_score_gemma":0.0004151894,"domain_scores_codex":[0.9972105,0.0001579271,0.0004146176,0.0007266208,0.0004965003,0.0009938462],"domain_scores_gemma":[0.998297,0.0004029186,0.00003141952,0.0007126965,0.0003548232,0.0002011911],"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.0003622126,0.0003754763,0.00005024837,0.00006122686,0.000152283,0.00001080947,0.002264315,0.3090389,0.01398266,0.002043738,0.2178665,0.4537917],"study_design_scores_gemma":[0.0008003055,0.0002422694,0.0000326918,0.0000213352,0.000005903933,0.000003290822,0.00004654844,0.8361503,0.002759971,0.00001348027,0.1596957,0.0002281199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09720608,0.000122502,0.8694527,0.03001794,0.0004584908,0.002420597,0.0001338951,0.0001319175,0.00005591966],"genre_scores_gemma":[0.3011917,0.0000632624,0.6818416,0.004704678,0.00368712,0.002940671,0.0001673263,0.00008050328,0.005323182],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5271115,"threshold_uncertainty_score":0.9995151,"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."}}