{"id":"W2114650657","doi":"10.1016/j.tcs.2006.05.011","title":"A PTAS for the minimization of polynomials of fixed degree over the simplex","year":2006,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":90,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nederlandse Organisatie voor Wetenschappelijk Onderzoek","keywords":"Mathematics; Degree (music); Simplex; Combinatorics; Discrete mathematics; Upper and lower bounds; Polynomial; Integer (computer science); Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0008469187,0.001180546,0.001103933,0.0007235842,0.0005892172,0.001381742,0.001726278,0.001419503,0.01462688],"category_scores_gemma":[0.003678152,0.0004182822,0.001339627,0.001175561,0.001050165,0.001703928,0.002478021,0.003177544,0.003206528],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008996444,"about_ca_system_score_gemma":0.001139114,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001622012,"about_ca_topic_score_gemma":0.002206514,"domain_scores_codex":[0.9992085,0.0002539079,0.00003109753,0.0001644154,0.0002759105,0.00006621215],"domain_scores_gemma":[0.9994214,0.0002450737,0.00003948392,0.0001078532,0.0001148774,0.00007150358],"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.0002743711,0.0001540028,0.0003940194,0.0004152607,0.00009989532,0.0001401126,0.0001571306,0.1504178,0.007209299,0.6311409,0.02475117,0.1848461],"study_design_scores_gemma":[0.00005635156,0.0001386753,0.0001498479,0.00005702005,0.00003347471,0.0001353403,0.00005834775,0.643398,0.001734999,0.3388901,0.01532304,0.00002482347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006729953,0.00025719,0.9763463,0.0005108336,0.0002257406,0.00007255332,0.0001875794,0.0003234946,0.01534631],"genre_scores_gemma":[0.2351114,0.0009587191,0.7109519,0.0005338066,0.0004833005,0.0004558319,0.000623218,0.0009657037,0.04991623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01462688,"threshold_uncertainty_score":0.04893184,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05602989794902363,"score_gpt":0.3618705996515992,"score_spread":0.3058407017025756,"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."}}