Parallel computation of Boolean Gröbner bases

Y. Sato
ysato@theory.cs.ritsumei.ac.jp
A. Suzuki
sakira@theory.cs.ritsumei.ac.jp  
Department of Computer Science
Ritsumeikan University
Japan

Abstract

Boolean rings are isomorphic to direct products of a Galois field GF (2).Using these structures, boolean Gröbner bases can be constructed by a parallel computation algorithm.We implemented this method using a parallel logic programming language KLIC.In this paper, we report on this work.

©1999. ATCM, Inc