#### Filter Results:

- Full text PDF available (0)

#### Publication Year

2007

2015

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

#### Publication Type

#### Co-author

#### Publication Venue

Learn More

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

- 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, Akira Nagai, Shutaro Inoue
- ASCM
- 2007

- Shutaro Inoue
- CASC
- 2009

- Shutaro Inoue, Yosuke Sato
- AISC
- 2014

- Shutaro Inoue, Akira Nagai
- ASCM
- 2009

- Akira Nagai, Shutaro Inoue
- ICMS
- 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[X 1 ,. 2 n − X n 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, is first introduced in [3, 4] with its computation algorithm in… (More)

- Shutaro Inoue, Kohei Mukaida, Akira Suzuki, Yosuke Sato
- ACM Comm. Computer Algebra
- 2008

X n ]. In order to decide whether p has an inverse in the residue class ring K[X 1 ,. .. , X n ]/I, there is a standard way to decide and compute it if exists. (See chapter 5 and 6 of [1] for example.) Step 1. Compute the reduced Gröbner basis G of the ideal p, These steps are simultaneously proceeded by so called extended Gröbner bases computations. It is… (More)

- ‹
- 1
- ›