{"title":"The Complexity of Elementary Problems in Archimedean Ordered Groups","authors":"V. Weispfenning","doi":"10.1007/3-540-15984-3_241","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":412002,"journal":{"name":"European Conference on Computer Algebra","volume":"213 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1985-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"European Conference on Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/3-540-15984-3_241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
