WASET
	@article{(Open Science Index):https://publications.waset.org/pdf/12247,
	  title     = {Groebner Bases Computation in Boolean Rings is P-SPACE},
	  author    = {Quoc-Nam Tran},
	  country	= {},
	  institution	= {},
	  abstract     = {The theory of Groebner Bases, which has recently been
honored with the ACM Paris Kanellakis Theory and Practice Award,
has become a crucial building block to computer algebra, and is
widely used in science, engineering, and computer science. It is wellknown
that Groebner bases computation is EXP-SPACE in a general
polynomial ring setting.
However, for many important applications in computer science
such as satisfiability and automated verification of hardware and
software, computations are performed in a Boolean ring. In this paper,
we give an algorithm to show that Groebner bases computation is PSPACE
in Boolean rings. We also show that with this discovery,
the Groebner bases method can theoretically be as efficient as
other methods for automated verification of hardware and software.
Additionally, many useful and interesting properties of Groebner
bases including the ability to efficiently convert the bases for different
orders of variables making Groebner bases a promising method in
automated verification.},
	    journal   = {International Journal of Mathematical and Computational Sciences},
	  volume    = {3},
	  number    = {9},
	  year      = {2009},
	  pages     = {698 - 703},
	  ee        = {https://publications.waset.org/pdf/12247},
	  url   	= {https://publications.waset.org/vol/33},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 33, 2009},
	}