{"id":"W2060309802","doi":"10.5555/338219.338663","title":"Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks","year":2000,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unimodular matrix; Linear programming; Oracle; Convergence (economics); Polynomial; Time complexity; Mathematics; Construct (python library); Algorithm; 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.002105986,0.001029899,0.0009997427,0.0005484897,0.0007944491,0.002454954,0.002265745,0.001072532,0.008924963],"category_scores_gemma":[0.01147754,0.0004449019,0.001132217,0.001223723,0.001713369,0.007948207,0.00220278,0.003634439,0.001318978],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001643305,"about_ca_system_score_gemma":0.001281074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001565053,"about_ca_topic_score_gemma":0.002138106,"domain_scores_codex":[0.997696,0.0006074033,0.0001140477,0.0005731698,0.0006183345,0.0003910617],"domain_scores_gemma":[0.9905166,0.006631837,0.0005259196,0.001553942,0.0005224453,0.0002491954],"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.001317487,0.0003547474,0.003311212,0.000786609,0.0001004381,0.0001749447,0.0004802198,0.1490014,0.01671384,0.4845114,0.01106233,0.3321853],"study_design_scores_gemma":[0.0001279686,0.0002360101,0.0007356778,0.0000439695,0.00005124246,0.0002832938,0.0001015886,0.518382,0.01284165,0.4582925,0.008870689,0.000033546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1070468,0.0004848799,0.8674048,0.002379376,0.00006286704,0.0001480003,0.0003257208,0.001716812,0.02043077],"genre_scores_gemma":[0.5710883,0.000560214,0.4115418,0.0006076886,0.0001463389,0.0003027566,0.001044679,0.000767115,0.01394103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008924963,"threshold_uncertainty_score":0.02985698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02927926635376855,"score_gpt":0.2800338732180439,"score_spread":0.2507546068642754,"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."}}