{"id":"W2054543516","doi":"10.1007/pl00011420","title":"Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems","year":2001,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Linear programming; Corollary; Condition number; Time complexity; Bounded function; Probabilistic logic; Matrix (chemical analysis); Combinatorics; Probabilistic analysis of algorithms; Discrete mathematics; Algorithm; Eigenvalues and eigenvectors; Statistics","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.01693156,0.002837637,0.003381334,0.008380854,0.002716942,0.012955,0.006177239,0.005284859,0.005746134],"category_scores_gemma":[0.1110765,0.002070204,0.003934826,0.006919021,0.009549895,0.02545445,0.008651962,0.01402031,0.0005694936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008318814,"about_ca_system_score_gemma":0.002768276,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001180166,"about_ca_topic_score_gemma":0.0007854765,"domain_scores_codex":[0.9808157,0.006412455,0.0009442162,0.003087336,0.006410963,0.002329269],"domain_scores_gemma":[0.8289772,0.1388993,0.01171258,0.008500021,0.006260491,0.005650545],"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.00008807953,0.00009192774,0.0009787931,0.0001402021,0.00004704878,0.0000327333,0.0002677949,0.01848432,0.0005547493,0.9675251,0.001245347,0.01054393],"study_design_scores_gemma":[0.00002001689,0.0000651165,0.001099818,0.00007297107,0.00003963042,0.0001064313,0.0001002365,0.1684849,0.0005753196,0.827561,0.001816694,0.00005778066],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07094704,0.003917242,0.8992126,0.006021594,0.0001934417,0.0001591877,0.0004224459,0.0002990314,0.0188274],"genre_scores_gemma":[0.8177348,0.00332174,0.1660016,0.001327275,0.00192832,0.001071159,0.0009437394,0.0004238023,0.007247454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01693156,"threshold_uncertainty_score":0.08954364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1489218390127356,"score_gpt":0.4044304144431907,"score_spread":0.255508575430455,"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."}}