{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127638,0.0002785803,0.0008194586,0.0003978647,0.0002713669,0.0001450334,0.0002453725,0.0001006653,0.00007663849],"category_scores_gemma":[0.003245032,0.0002441874,0.0002094837,0.001538046,0.0004623492,0.0002121582,0.0001278313,0.0001849383,0.000002972827],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006767357,"about_ca_system_score_gemma":0.00005033678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007652777,"about_ca_topic_score_gemma":0.00003359429,"domain_scores_codex":[0.9972928,0.0001106647,0.0009594961,0.0004666869,0.0005935971,0.0005768258],"domain_scores_gemma":[0.9973416,0.001034615,0.0003653343,0.0004497599,0.0006076769,0.0002009569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001836604,0.004138392,0.00354926,0.007153422,0.002933061,0.00001290921,0.004756193,0.005725715,0.001008643,0.6740797,0.00002624726,0.2964329],"study_design_scores_gemma":[0.001179525,0.000229796,0.000140728,0.0002299577,0.001258684,0.00002211064,0.0003207774,0.7335758,0.000114398,0.2594104,0.003053062,0.0004647771],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02090244,0.00006987406,0.9756001,0.0001834641,0.00001998882,0.002852904,0.00002524186,0.0002193539,0.0001266748],"genre_scores_gemma":[0.09436417,0.00001860935,0.9043634,0.00001397502,0.00005310006,0.0007860314,0.00008756525,0.00006662441,0.0002465091],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7278501,"threshold_uncertainty_score":0.9957674,"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."}}