#### Filter Results:

- Full text PDF available (0)

#### Publication Year

1969

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (10)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Shutaro Inoue, Yosuke Sato
- PASCO
- 2007

We report on our implementation for parallel computations of comprehensive Gröbner systems (introduced by Weispfenning [7]) based on Suzuki-Sato algorithm. It is the first ever parallel implementation of comprehensive Gröbner systems.

- Yosuke Sato, Shutaro Inoue, Akira Suzuki, Katsusuke Nabeshima, Kô Sakai
- J. Symb. Comput.
- 2011

- Yosuke Sato, Akira Nagai, Shutaro Inoue
- ASCM
- 2007

In order to compute an eliminate portion of a given polynomial ideal by a Gröbner basis computation, we usually need to compute a Gröbner basis of the whole ideal with respect to some proper term order. In a boolean polynomial ring, we show that we can compute an eliminate portion by computing Gröbner bases in the boolean polynomial ring with the same… (More)

- Akira Nagai, Shutaro Inoue
- ICMS
- 2014

- Shutaro Inoue
- CASC
- 2009

- Shutaro Inoue, Akira Nagai
- ASCM
- 2009

- Shutaro Inoue, Yosuke Sato
- AISC
- 2014

- Ryoya Fukasaku, Shutaro Inoue, Yosuke Sato
- Mathematics in Computer Science
- 2015

- Shutaro Inoue, Yosuke Sato
- ACM Comm. Computer Algebra
- 2009

A commutative ring B with an identity is called a boolean ring if every element of which is idempotent. A residue class ring B[X1, . . . , Xn]/〈X 1 −X1, . . . , X n−Xn〉 with an ideal 〈X2 1 −X1, . . . , X n−Xn〉 also becomes a boolean ring, which is called a boolean polynomial ring. A Gröbner basis in a boolean polynomial ring, called a boolean Gröbner basis,… (More)

- S Inoue
- Nihon Sanka Fujinka Gakkai zasshi
- 1969