{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003762455,0.001049283,0.00169774,0.001309835,0.001427868,0.00427998,0.002583637,0.001414448,0.00674101],"category_scores_gemma":[0.02061159,0.0007333988,0.001270296,0.002612131,0.002484241,0.006312539,0.003363646,0.004343069,0.00157363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002641367,"about_ca_system_score_gemma":0.003087081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003343072,"about_ca_topic_score_gemma":0.003272239,"domain_scores_codex":[0.9954537,0.001893959,0.0001677443,0.0004635704,0.001160198,0.0008607447],"domain_scores_gemma":[0.98339,0.01244544,0.0005510346,0.002379569,0.0007872087,0.0004468095],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001829563,0.0007153965,0.002920764,0.0005656503,0.0001452874,0.0002377223,0.0006505648,0.4134265,0.007692062,0.3473005,0.03287551,0.1916405],"study_design_scores_gemma":[0.0001168582,0.00005909234,0.0002523449,0.00003169526,0.00003206838,0.0000415974,0.00008926959,0.6910375,0.001679332,0.3041627,0.002476699,0.0000209377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3524539,0.002614937,0.5718632,0.01179675,0.0002803225,0.0004490089,0.001915854,0.003255615,0.05537049],"genre_scores_gemma":[0.7566933,0.001130871,0.2273703,0.001016473,0.0002515479,0.0007193437,0.002426523,0.0009535264,0.009438179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00674101,"threshold_uncertainty_score":0.02255094,"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."}}