-
Modular Algorithms for Computing Minimal Associated Primes and radicals of Polynomial Ideals
Peer-reviewed
Toru Aoyama, Masayuki Noro
Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation
31
-
38
7 2018
-
Usage of Modular Techniques for Efficient Computation of Ideal Operations, Mathematics in Computer Science
Peer-reviewed
Masayuki Noro, Kazuhiro Yokoyama
Mathematics in Computer Science12
(
1
)
1
-
32
3 2018
-
System of Partial Differential Equations for the Hypergeometric Function 1F1 of a Matrix Argument on Diagonal Regions
Peer-reviewed
M. Noro
Proc. ISSAC 2016
2016
-
Schwarz maps for the hypergeometric differential equation
Peer-reviewed
S. Fujimori, M. Noro, K. Saji, T. Sasaki, M. Yoshida
International J. Math.
2015
-
Verification of Groebner Basis Candidates
Peer-reviewed
M. Noro, K. Yokoyama
Proc. ICMS 2014
2014
-
Implementation of a primary decomposition package
Peer-reviewed
M. Noro
Harmony of Groebner Bases and the Modern Industrial Society
2012
-
Holonomic gradient descent and its application to the Fisher-Bingham integral
Peer-reviewed
H. Nakayama, K. Nishiyaa, M. Noro, K. Ohara, T. Sei, N. Takayama, A. Takemura
Adv. in Appl. Math.
2011
-
Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
Peer-reviewed
T. Kawazoe, M. Noro
J. Symb. Comp.
2011
-
New Algorithms for Computing Primary Decomposition of Polynomial Ideals
Invited
Peer-reviewed
M. Noro
Proc. ICMS 2010
2010
-
Stratification associated with local b-functions
Peer-reviewed
K. Nishiyama, M. Noro
J. Symb. Comp.
2010
-
Modular Algorithms for Computing a Generating Set of the Syzygy Module
Peer-reviewed
M. Noro
Proc. CASC 2009
2009
-
On a conjecture for the dimension of the space of the multiple zeta values
Peer-reviewed
M. Kaneko, M. Noro, K. Tsurumaki
Software for algebraic geometry
2008
-
Confluence of Swallowtail Singularities of the Hyperbolic Schwarz Map Defined by the Hypergeometric Differential Equation
Peer-reviewed
M. Noro, T. Sasaki, K. Yamada, M. Yoshida
Experimental Math.
2008
-
Computation of Discrete Comprehensive Groebner Bases Using Modular Dynamic Evaluation
Peer-reviewed
Y. Kurata, M. Noro
Proc. ISSAC 2007
2007
-
An efficient implementation for computing Groebner bases over algebraic number fields
Peer-reviewed
M. Noro
Proc. ICMS 2006
2006
-
Modular Dynamic Evaluation
Peer-reviewed
M. Noro
Proc. ISSAC 2006
2006
-
Automatic weight generator for the Buchberger algorithm
Peer-reviewed
K. Kimura, M. Noro
Proc. MACIS 2006
2006
-
Existence of the exact CNOT on a quantum computer with the exchange interaction
Peer-reviewed
Y. Kawano, K. Kimura, H. Sekigawa, M. Noro, K. Shirayanagi, M. Kitagawa, M. Ozawa
Quantum Information Processing
2005
-
Dynamic Evaluation の実装について
Peer-reviewed
野呂正行
数式処理
2005
-
Implementation of prime decomposition of polynomial ideals over small finite fields
Peer-reviewed
M. Noro, K. Yokoyama
Implementation of prime decomposition of polynomial ideals over small finite fields
2004
-
A Computer Algebra System Risa/Asir
Peer-reviewed
M. Noro
Algebra, Geometry and Software
2003
-
An Efficient Modular Algorithm for Computing the Global b-function
Peer-reviewed
M. Noro
Proc. ICMS 2002
2002
-
Yet Another Practical Implementation of Polynomial Factorization over Finite Fields
Peer-reviewed
M. Noro, K. Yokoyama
Proc. ISSAC 2002
2002
-
The Design and Implementation of OpenXM-RFC 100 and 101
Peer-reviewed
M. Maekawa, M. Noro, K. Ohara, N. Takayama, Y. Tamura
Proc. ASCM 2001
2001
-
OpenXM -- an Open System to Integrate Mathematical Software
Peer-reviewed
M. Maekawa, M. Noro, K. Ohara, Y. Okutani, N. Takayama, Y. Tamura
Proc. CALCULEMUS 2000
2000
-
A Modular Method to Compute the Rational Univariate Representation of Zero-Dimensional Ideals
Peer-reviewed
M. Noro, K. Yokoyama
J. Symb. Comp.
1999
-
Order Counting of Elliptic Curves Defined over Finite Fields of Characteristic 2
Peer-reviewed
T. Izu, J. Kogure, M. Noro, K. Yokoyama
電子情報通信学会 論文誌
1999
-
Factoring Polynomials over Algebraic Extension Fields
Peer-reviewed
M. Noro, K. Yokoyama
城西情報科学研究9
(
1
)
11
-
33
1998
-
Efficient implementation of Schoof's algorithm
Peer-reviewed
T. Izu, J. Kogure, M. Noro, K. Yokoyama
Proc. ASIACRYPT '98
1998
-
Factoring Polynomials over Algebraic Extension Fields
Peer-reviewed
M. Noro, K. Yokoyama
城西情報科学研究
1998
-
Computation of replicable functions on Risa/Asi
Peer-reviewed
M. Noro, J. McKay
Proc PASCO '97
1997
-
Quasi-Zalgaller polyhedra belonging to M21
Peer-reviewed
M. Noro, J. Sekiguchi
数式処理
1997
-
Computation of the Splitting fields and the Galois Groups of Polynomials, Algorithms in Algebraic geometry and Applications
Peer-reviewed
H. Anai, M. Noro, K. Yokoyama
Proc. MEGA '94
1996
-
Risa/Asir -- A Computer Algebra System
Peer-reviewed
M. Noro, T. Takeshima
Proc. ISSAC '92
1992
-
Solution of systems of algebraic equations and linear maps over residue class rings
K. Yokoyama, M. Noro, T. Takeshima
J. Symb. Comp.
1991
-
Computing Primitive Elements of Extension Fields
Peer-reviewed
K. Yokoyama, M. Noro, T. Takeshima
J. Symb. Comp.
1989
-
The theory of Radon transformations and 2-micro localization (I)
Peer-reviewed
M. Noro, N. Tose
J. Fac. Sci, Univ. Tokyo, Sect. IA
1987
