22173 George Avrunin: Symbolic model checking using algebraic
geometry. Springer LN CS 1102 (1991), 26-37.

17406 George Avrunin: Symbolic model checking using algebraic geometry.
Internet 1996, 14p.

19708 Richard Beigel/Anna Bernasconi: A note on the polynomial
representation of boolean functions over GF(2).
Int. J. Found. Comp. Sci. 10/4 (1999), 535-542.

15963 Anna Bernasconi: Mathematical techniques for the analysis of
boolean functions. PhD thesis Univ. Pisa 1998, 126p.

15969 Anna Bernasconi/Bruno Codenotti/Valentino Crespi/Giovanni Resta:
Computing Gröbner bases in the boolean setting with applications to
counting. Internet ca. 1998, 10p.

15967 Anna Bernasconi/Lavinia Egidi: Hilbert function and complexity lower
bounds for symmetric boolean functions. Inf. Comput. 153 (1999), 1-25.

15978 Hubie Chen: Polynomial programs and the Razborov-Smolensky method.
Electronic Coll. Comput. Complexity Rep. 67 (2001), 15p.

15966 Gabor Hegedüs/Lajos Ronyai: Gröbner bases for complete uniform
families. Internet 2003, 13p.

21815 Franziska Hinkelmann/Elizabeth Arnold: Fast Gröbner basis
computation for boolean polynomials. Internet 2010, 8p.

20377 Abdul Jarrah/Reinhard Laubenbacher: On the algebraic geometry
of polynomial dynamical systems. Internet (arxiv - 0803.1825) 2008, 15p.

20375 Abdul Salam Jarrah/Blessilda Raposa/Reinhard Laubenbacher: Nested
canalyzing, unate cascade, and polynomial functions. Internet 2007, 17p.

15968 Erion Plaku/Igor Shparlinski: On polynomial representations
of boolean functions related to some number theoretic properties.
Internet ca. 2002, 12p.

23125 Yosuke Sato/.../Ko Sakai: Boolean Gröbner bases.
J. Symb. Comp. 46 (2011), 622-632.

15297 Iwaro Takahashi: Switching functions constructed by Galois
extension fields. Inf. Control 48 (1981), 95-108.

15965 Shi-chun Tsai: Lower bounds on representing boolean functions as
polynomials in Z_m. Internet ca. 1993, 8p.