{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001624966,0.0002009794,0.0002145872,0.0002130916,0.0002879736,0.00007532858,0.0008358734,0.00009583873,0.000004948175],"category_scores_gemma":[0.0000397243,0.000187173,0.0001273637,0.0005094608,0.00006694128,0.0004576264,0.0002714246,0.00004603905,0.000146549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003520278,"about_ca_system_score_gemma":0.0001055178,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001275802,"about_ca_topic_score_gemma":0.0001003764,"domain_scores_codex":[0.9984683,0.00006828932,0.000235664,0.0007745774,0.00007616493,0.0003770212],"domain_scores_gemma":[0.9988007,0.0001397484,0.0001695372,0.0005064672,0.0001511967,0.000232382],"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.00114161,0.0007258335,0.005273743,0.0001998207,0.0002251085,0.00008127696,0.001267249,0.05568523,0.0540316,0.6911181,0.009051361,0.1811991],"study_design_scores_gemma":[0.002200676,0.0001715748,0.003072268,0.00004415075,0.00002822336,0.00001178734,0.00004409401,0.9853113,0.004265298,0.0007132429,0.003684134,0.0004532947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1713473,0.000006140606,0.8269371,0.0002936664,0.0004252331,0.0005323666,0.00002653532,0.0003108862,0.00012078],"genre_scores_gemma":[0.9808382,0.000002000384,0.01820744,0.0001065433,0.0002223713,0.000007358735,0.000008672088,0.00001594412,0.0005914539],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.929626,"threshold_uncertainty_score":0.7632694,"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."}}