{"title":"二元系统解的复杂性:非奇异解的情况","authors":"R. Lebreton, E. Mehrabi, É. Schost","doi":"10.1145/2465506.2465950","DOIUrl":null,"url":null,"abstract":"We give an algorithm for solving bivariate polynomial systems over either <i>k</i>(<i>T</i>)[<i>X,Y</i>] or <i>Q</i>[<i>X,Y</i>] using a combination of lifting and modular composition techniques.","PeriodicalId":243282,"journal":{"name":"International Symposium on Symbolic and Algebraic Computation","volume":"71 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"On the complexity of solving bivariate systems: the case of non-singular solutions\",\"authors\":\"R. Lebreton, E. Mehrabi, É. Schost\",\"doi\":\"10.1145/2465506.2465950\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We give an algorithm for solving bivariate polynomial systems over either <i>k</i>(<i>T</i>)[<i>X,Y</i>] or <i>Q</i>[<i>X,Y</i>] using a combination of lifting and modular composition techniques.\",\"PeriodicalId\":243282,\"journal\":{\"name\":\"International Symposium on Symbolic and Algebraic Computation\",\"volume\":\"71 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-06-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Symbolic and Algebraic Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2465506.2465950\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Symbolic and Algebraic Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2465506.2465950","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On the complexity of solving bivariate systems: the case of non-singular solutions
We give an algorithm for solving bivariate polynomial systems over either k(T)[X,Y] or Q[X,Y] using a combination of lifting and modular composition techniques.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
