{"title":"证明根式不等式的算法","authors":"Meijing Shan","doi":"10.1109/ICECTECH.2010.5479988","DOIUrl":null,"url":null,"abstract":"In this paper, we present an algorithm to prove radical inequalities. The main idea of this algorithm is to utilize a numeric method as a filter. If it succeeds, then the algorithm will be more efficient. Otherwise, it falls back to the symbolic methods. We illustrate the efficiency of this algorithm by automatically proving a radical inequality.","PeriodicalId":178300,"journal":{"name":"2010 2nd International Conference on Electronic Computer Technology","volume":"140 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithm for proving radical inequalities\",\"authors\":\"Meijing Shan\",\"doi\":\"10.1109/ICECTECH.2010.5479988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we present an algorithm to prove radical inequalities. The main idea of this algorithm is to utilize a numeric method as a filter. If it succeeds, then the algorithm will be more efficient. Otherwise, it falls back to the symbolic methods. We illustrate the efficiency of this algorithm by automatically proving a radical inequality.\",\"PeriodicalId\":178300,\"journal\":{\"name\":\"2010 2nd International Conference on Electronic Computer Technology\",\"volume\":\"140 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Conference on Electronic Computer Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICECTECH.2010.5479988\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Conference on Electronic Computer Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECTECH.2010.5479988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we present an algorithm to prove radical inequalities. The main idea of this algorithm is to utilize a numeric method as a filter. If it succeeds, then the algorithm will be more efficient. Otherwise, it falls back to the symbolic methods. We illustrate the efficiency of this algorithm by automatically proving a radical inequality.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
