#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1989

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Masayuki Noro, Taku Takeshima
- ISSAC
- 1992

A computer algebra system risa/asir consists of a command asir for interactive use and several subroutine libraries which can be used as the parts of other programs. The grammar of the user language of asir is a variant of that of C and asir has a built-in dbx-like debugger. Risa’s subroutine libraries include basic arithmetic subroutines, parser, evaluator… (More)

- Masayuki Noro
- Algebra, Geometry, and Software Systems
- 2003

- Masayuki Noro, Kazuhiro Yokoyama
- ISSAC
- 2002

Polynomial factorization plays a significant role in computational mathematics and its application to engineering, since it forms a fundamental part of algorithms for higher algebraic computations. Multivariate polynomial factorization over finite fields is very important for computations of mathematical object over positive characteristic fields, which… (More)

- Masayuki Noro, Kazuhiro Yokoyama
- J. Symb. Comput.
- 1999

To give an efficiently computable representation of the zeros of a zero-dimensional ideal I, Rouillier (1996) introduced the rational univariate representation (RUR) as an extension of the generalized shape lemma (GSL) proposed by Alonso et al. (1996). In this paper, we propose a new method to compute the RUR of the radical of I, and report on its practical… (More)

- Kenta Nishiyama, Masayuki Noro
- J. Symb. Comput.
- 2010

- Masayuki Noro
- ICMS
- 2006

- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
- J. Symb. Comput.
- 1992

In this paper, we present new mathematical results and several new algorithms for solving a system of algebraic equations algebraically . We find that many ideal-theoretical arguments for the problem can be translated into their counterparts in the theory of linear maps . And by this translation, we succeed in giving a new description for the Uresultant and… (More)

- Tomonari Sei, Nobuki Takayama, +4 authors Katsuyoshi Ohara
- ArXiv
- 2010

The gradient descent is a general method to find a local minimum of a smooth function f(z1, . . . , zd). The method utilizes the observation that f(p) decreases if one goes from a point z = p to a “nice” direction, which is usually −(∇f)(p). As textbooks on optimizations present (see, e.g., [5], [16]), we have a lot of achievements on this method and its… (More)

- Kazuhiro Yokoyama, Masayuki Noro, Taku Takeshima
- J. Symb. Comput.
- 1989

- Tetsuya Izu, Jun Kogure, Masayuki Noro, Kazuhiro Yokoyama
- ASIACRYPT
- 1998