咨询与建议

限定检索结果

文献类型

  • 4 篇 会议
  • 2 篇 期刊文献

馆藏范围

  • 6 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 6 篇 工学
    • 6 篇 计算机科学与技术...
    • 2 篇 电气工程
  • 4 篇 理学
    • 4 篇 数学

主题

  • 6 篇 fglm algorithm
  • 6 篇 grobner bases
  • 1 篇 complexity analy...
  • 1 篇 tropical geometr...
  • 1 篇 algorithms
  • 1 篇 algebraic-geomet...
  • 1 篇 algebraic extens...
  • 1 篇 parametric linea...
  • 1 篇 gaussian elimina...
  • 1 篇 forney formula
  • 1 篇 zero-dimensional...
  • 1 篇 comprehensive gr...
  • 1 篇 parametric fglm ...
  • 1 篇 bms algorithm
  • 1 篇 change of orderi...
  • 1 篇 wiedemann algori...
  • 1 篇 sparse matrix
  • 1 篇 comprehensive gr...
  • 1 篇 polynomial ideal...
  • 1 篇 minimal polynomi...

机构

  • 2 篇 isfahan univ tec...
  • 2 篇 inst res fundame...
  • 1 篇 wolfram res 100 ...
  • 1 篇 auburn univ dept...
  • 1 篇 univ limoges lim...
  • 1 篇 cnrs xlim umr 72...
  • 1 篇 univ paris 06 in...
  • 1 篇 univ paris 06 so...
  • 1 篇 rikkyo univ grad...
  • 1 篇 univ tehran sch ...
  • 1 篇 rikkyo univ dept...

作者

  • 2 篇 hashemi amir
  • 2 篇 faugere jean-cha...
  • 1 篇 leonard da
  • 1 篇 darmian mahdi de...
  • 1 篇 yokoyama kazuhir...
  • 1 篇 vaccon tristan
  • 1 篇 lichtblau daniel
  • 1 篇 berthomieu jerem...
  • 1 篇 mou chenqi
  • 1 篇 ishihara yuki

语言

  • 6 篇 英文
检索条件"主题词=FGLM algorithm"
6 条 记 录,以下是1-10 订阅
排序:
Parametric fglm algorithm
收藏 引用
JOURNAL OF SYMBOLIC COMPUTATION 2017年 82卷 38-56页
作者: Darmian, Mahdi Dehghani Hashemi, Amir Univ Tehran Sch Math Stat & Comp Sci Coll Sci Tehran 141556455 Iran Isfahan Univ Technol Dept Math Sci Esfahan *** Iran Inst Res Fundamental Sci IPM Sch Math Tehran 193955746 Iran
In this paper, we consider the non-trivial problem of converting a zero-dimensional parametric Grobner basis w.r.t. a given monomial ordering to a Grobner basis w.r.t. any other monomial ordering. We present a new alg... 详细信息
来源: 评论
On fglm algorithms with Tropical Grobner bases  20
On FGLM Algorithms with Tropical Grobner bases
收藏 引用
45th International Symposium on Symbolic and Algebraic Computation
作者: Ishihara, Yuki Vaccon, Tristan Yokoyama, Kazuhiro Rikkyo Univ Grad Sch Sci Tokyo Japan Univ Limoges Limoges France CNRS XLIM UMR 7252 Limoges France Rikkyo Univ Dept Math Tokyo Japan
Let K be a field equipped with a valuation. Tropical varieties over K can be defined with a theory of Grobner bases taking into account the valuation of K. Because of the use of the valuation, the theory of tropical G... 详细信息
来源: 评论
Efficient Forney functions for decoding AG codes
收藏 引用
IEEE TRANSACTIONS ON INFORMATION THEORY 1999年 第1期45卷 260-265页
作者: Leonard, DA Auburn Univ Dept Discrete & Stat Sci Auburn AL 36849 USA
Using a Forney formula to solve for the error magnitudes in decoding AG codes requires producing functions sigma(P), which are 0 at all but one point P of the variety of the error-locator ideal. The best such function... 详细信息
来源: 评论
Fast algorithm for Change of Ordering of Zero-dimensional Grobner Bases with Sparse Multiplication Matrices  11
Fast Algorithm for Change of Ordering of Zero-dimensional Gr...
收藏 引用
36th International Symposium on Symbolic and Algebraic Computation
作者: Faugere, Jean-Charles Mou, Chenqi Univ Paris 06 INRIA Paris Rocquencourt SALSA Project CNRSUMR 7606LIP 6 F-75005 Paris France
Let I subset of K[x(1), ... , x(n)] be a 0-dimensional ideal of degree D where K is a field. It is well-known that obtaining efficient algorithms for change of ordering of Grobner bases of I is crucial in polynomial s... 详细信息
来源: 评论
On the Complexity of Linear Algebra Operations over Algebraic Extension Fields  1
收藏 引用
25th International Workshop on Computer Algebra in Scientific Computing (CASC)
作者: Hashemi, Amir Lichtblau, Daniel Isfahan Univ Technol Dept Math Sci Esfahan *** Iran Inst Res Fundamental Sci IPM Sch Math Tehran 193955746 Iran Wolfram Res 100 Trade Ctr Dr Champaign IL 61820 USA
In this paper, we study the complexity of performing some linear algebra operations such as Gaussian elimination and minimal polynomial computation over an algebraic extension field. For this, we use the theory of Gro... 详细信息
来源: 评论
Guessing Linear Recurrence Relations of Sequence Tuples and P-recursive Sequences with Linear Algebra  16
Guessing Linear Recurrence Relations of Sequence Tuples and ...
收藏 引用
41st ACM International Symposium on Symbolic and Algebraic Computation (ISSAC)
作者: Berthomieu, Jeremy Faugere, Jean-Charles Univ Paris 06 Sorbonne Univ Lab Informat Paris 6 CNRSINRIAEquipe PolSys 4 Pl Jussieu F-75252 Paris 05 France
Given several n-dimensional sequences, we first present an algorithm for computing the Grobner basis of their module of linear recurrence relations. A P-recursive sequence (u(i))i is an element of N-n, satisfies linea... 详细信息
来源: 评论