排序方式： 共有2条查询结果，搜索用时 15 毫秒
1
1.
TheoryofGr6bnerbasesinpolynomialalgebrak[X]isthemostfundamentalcomputationaltheoryincompilationalalgebraicgeometyll--5].Nevertheless,efficienciesofthealgorithmsofGrobnerbasesareverylowlybecauseofspecialpropertyofsymboliccomputation.Algorithmsinsemigr... 相似文献
2.
Fibre of Toric Map and Solving Affine Polynomial System 总被引：3，自引：0，他引：3
In[1],B.Sturmfelsdiscussedthecomputationaltheoryoftoricvariety.In[2],I.M.GelfanddiscussedsystematicallythetheoryofsolvingLaurentpolynomialsystemintorus(C*)n,C*=C\{0}.Butinmostapplyingcases,moreimportantthingisdoinginaffinespaceCn.Results,wehavebefore... 相似文献
1