搜索历史记录选项已关闭,请开启搜索历史记录选项。
作者: Barry Marshall Trager
DOI:
关键词:
摘要: … field, it is very useful to guarantee that our defining polynomial is irreducible over the algebraic closure of our coefficient domain, ie is absolutely irreducible. In Chapter Three we present …
Journal of Mathematical Sciences,2002, 引用: 3
,2000, 引用: 3
,2001, 引用: 1
,1991, 引用: 4
,2000, 引用: 1
Number Theory,1987, 引用: 13
Algorithms for Computer Algebra,1992, 引用: 1
,2007, 引用: 1
algorithmic number theory symposium,1994, 引用: 0
european conference on computer algebra,1987, 引用: 2