{"id":"W1980582286","doi":"","title":"Basis reduction and the complexity of branch-and-bound","year":2010,"lang":"en","type":"article","venue":"","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Upper and lower bounds; Lattice reduction; Combinatorics; Matrix (chemical analysis); Integer matrix; Integer (computer science); Reduction (mathematics); Lattice (music); Matrix multiplication; Constraint (computer-aided design); Branch and bound; Discrete mathematics; Mathematical optimization; Symmetric matrix; Computer science; Nonnegative matrix; Eigenvalues and eigenvectors","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.0003434878,0.00005673544,0.0001042259,0.00003647724,0.0001594729,0.00007987102,0.0002649585,0.00002555392,0.00003199809],"category_scores_gemma":[0.00002283835,0.00003605066,0.00003064633,0.0001515091,0.001380038,0.0001767381,0.0001966893,0.0001266358,0.000001467504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000001425794,"about_ca_system_score_gemma":0.0000104018,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000252052,"about_ca_topic_score_gemma":0.00009779345,"domain_scores_codex":[0.9994996,0.00003643099,0.0001130345,0.0001578703,0.0001076215,0.00008550334],"domain_scores_gemma":[0.9995054,0.00008222904,0.00004160124,0.0002993494,0.00003800431,0.00003341363],"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.000005107458,0.00001235839,0.0001100723,0.000005220151,0.000006072571,9.456409e-8,0.0003542681,2.243545e-7,0.001396092,0.9550588,0.00009260375,0.04295915],"study_design_scores_gemma":[0.0007411664,0.00003014856,0.02436691,0.000005129621,0.000007073067,0.00009312617,0.00005170842,0.02553017,0.006383027,0.9412271,0.001460209,0.0001041972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8090844,0.0001539667,0.1653497,0.01355361,0.0009302771,0.0002285652,0.000002894038,0.0001088204,0.0105878],"genre_scores_gemma":[0.9589503,0.00002015986,0.04077199,0.0000956011,0.00004417522,0.000002576542,2.430525e-7,0.000001637954,0.0001133476],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1498659,"threshold_uncertainty_score":0.5084807,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03230018893325343,"score_gpt":0.2510442902643339,"score_spread":0.2187441013310805,"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."}}