{"id":"W2963147061","doi":"10.48550/arxiv.1605.07433","title":"Bit complexity for multi-homogeneous polynomial system solving\\n Application to polynomial minimization","year":2016,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Polynomial and algebraic computation","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Institut Universitaire de France","keywords":"Mathematics; Homogeneous polynomial; Polynomial; Matrix polynomial; TRACE (psycholinguistics); Time complexity; Rank (graph theory); Minification; Set (abstract data type); Jacobian matrix and determinant; Probabilistic analysis of algorithms; Algebraic number; Quadratic equation; Linear system; Discrete mathematics; Algorithm; Probabilistic logic; Mathematical optimization; Applied mathematics; Combinatorics; Computer science","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001660477,0.0006408317,0.0008857496,0.0005893551,0.00082626,0.002057546,0.001445945,0.0008419886,0.007727359],"category_scores_gemma":[0.008511689,0.0002878463,0.0008738372,0.001131584,0.001544656,0.003870578,0.00296292,0.002419081,0.0009116404],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001767104,"about_ca_system_score_gemma":0.001356568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001655692,"about_ca_topic_score_gemma":0.003034672,"domain_scores_codex":[0.9985099,0.0004155663,0.0001004723,0.0002501955,0.0004549857,0.0002689269],"domain_scores_gemma":[0.9945409,0.003865568,0.0002267683,0.0009229134,0.0003073555,0.0001365687],"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.0007252584,0.0001557732,0.001785666,0.0005077064,0.00006391455,0.0001387782,0.0004821914,0.2265225,0.01056507,0.6101668,0.008440404,0.1404459],"study_design_scores_gemma":[0.00003495141,0.00005275095,0.000320079,0.00001668381,0.00002569197,0.00005437024,0.00004535985,0.7061222,0.004033443,0.2875317,0.001746007,0.00001684741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0769029,0.0004785159,0.9069659,0.001794492,0.00006298853,0.0001118326,0.0002734052,0.0008550112,0.01255494],"genre_scores_gemma":[0.7264143,0.0004871301,0.2621025,0.000417527,0.0001781759,0.0002705045,0.0005942207,0.0003930817,0.009142448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007727359,"threshold_uncertainty_score":0.02585059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06810500390180539,"score_gpt":0.2020160028834323,"score_spread":0.1339109989816269,"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."}}