CAD难题:Lex-Least vs Order

S. McCallum, Akshar Nair, James H. Davenport, G. Sankaran
{"title":"CAD难题:Lex-Least vs Order","authors":"S. McCallum, Akshar Nair, James H. Davenport, G. Sankaran","doi":"10.1109/SYNASC51798.2020.00017","DOIUrl":null,"url":null,"abstract":"This paper is part of our ongoing research and collaboration on understanding the relations between CAD algorithms, equational constraints and curtains. Our previous work manages to circumvent the curtain problem in the single equational constraint by taking advantage of the Lex-least valuation (even in the presence of curtains). That method however fails to take full advantage of multiple equational constraints. In this paper we provide further clarification of McCallum's work to validate the use of restricted projection operator at 2 levels. We also discuss the close relationship between order invariant and lex-least invariant CAD's.","PeriodicalId":278104,"journal":{"name":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"The CAD Conundrum: Lex-Least vs Order\",\"authors\":\"S. McCallum, Akshar Nair, James H. Davenport, G. Sankaran\",\"doi\":\"10.1109/SYNASC51798.2020.00017\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper is part of our ongoing research and collaboration on understanding the relations between CAD algorithms, equational constraints and curtains. Our previous work manages to circumvent the curtain problem in the single equational constraint by taking advantage of the Lex-least valuation (even in the presence of curtains). That method however fails to take full advantage of multiple equational constraints. In this paper we provide further clarification of McCallum's work to validate the use of restricted projection operator at 2 levels. We also discuss the close relationship between order invariant and lex-least invariant CAD's.\",\"PeriodicalId\":278104,\"journal\":{\"name\":\"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"volume\":\"49 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SYNASC51798.2020.00017\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 22nd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SYNASC51798.2020.00017","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文是我们正在进行的研究和合作的一部分,旨在理解CAD算法、方程约束和幕布之间的关系。我们以前的工作设法通过利用Lex-least估值(即使在存在窗帘的情况下)来规避单方程约束中的窗帘问题。然而,这种方法不能充分利用多重方程约束。在本文中,我们进一步澄清了McCallum的工作,以验证限制投影算子在2水平上的使用。我们还讨论了阶不变量和列最小不变量CAD之间的密切关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The CAD Conundrum: Lex-Least vs Order
This paper is part of our ongoing research and collaboration on understanding the relations between CAD algorithms, equational constraints and curtains. Our previous work manages to circumvent the curtain problem in the single equational constraint by taking advantage of the Lex-least valuation (even in the presence of curtains). That method however fails to take full advantage of multiple equational constraints. In this paper we provide further clarification of McCallum's work to validate the use of restricted projection operator at 2 levels. We also discuss the close relationship between order invariant and lex-least invariant CAD's.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信