D. Bochmann/B. Steinbach: Logikentwurf mit XBOOLE - Algorithmen und
Programme. Technik 1991.

15939 Debatosh Debnath/Tsutomu Sasao: Fast boolean matching under permutation
using representative. ASP-DAC January 1999, 359-362.

15921 Bogdan Falkowski: A comment on "generalized Reed-Muller forms as a
tool to detect symmetries". IEEE Trans. Computers 52/7 (2003), 975-976.
[Boole, 13]

23032 Luis David Garcia/Abdul Salam Jarrah/Reinhard Laubenbacher:
Sequential dynamical systems over words. Appl. Math. Comp. 174 (2006), 500-510.

27015 Mariusz Grech: Regular symmetric groups of boolean functions.
Discrete Math. 310 (2010), 2877-2882.

15938 Peter Bro Miltersen/Mike Paterson/Jun Tarui: The asymptotic complexity
of merging networks. Proc. IEEE Symp. Found. CS October 1992, 236-246.

27092 Andrzej Kisielewicz: Symmetry groups of boolean functions and constructions
of permutation groups. J. Algebra 199 (1998), 379-403.

15347 Paul Molitor/Christoph Scholl: Datenstrukturen und effiziente
Algorithmen für die Logiksynthese kombinatorischer Schaltungen.
Teubner 1999, 300p. Eur 28.

J. Mohnke/S. Malik: Permutation and phase independent Boolean comparison.
Integration 16 (1993), 109-129.

J. Mohnke/Paul Molitor/S. Malik: Limits of using signatures for permutation
independent Boolean comparison.
Asia South Pac. Design Autom. Conf. 1995, 459-464.

24115 Chengxin Qu/Jennifer Seberry/Josef Pieprzyk: Relationships between
boolean functions and symmetric groups. Internet ca. 2001, 7p.

15323 Christoph Scholl/Stephan Melchior/Günter Hotz/Paul Molitor:
Minimizing ROBBD sizes of incompletely specified boolean functions by
exploiting strong symmetries. Internet ca. 1997, 6p.

C. Tsai/M. Marek-Sadowska: Generalized Reed-Muller forms as a tool to
detect symmetries. IEEE Trans. Computers 45/1 (1996), 33-40.

C. Tsai/M. Marek-Sadowska: Boolean functions classification via fixed
polarity Reed-Muller forms. IEEE Trans. Computers 46/2 (1997), 173-186.