Details

Autor(en) / Beteiligte

• Butler, J.T.
• Dueck, G.W.
• Shmerko, V.P.
• Yanuskevich, S.

Titel

Comments on "Sympathy: fast exact minimization of fixed polarity Reed-Muller expansion for symmetric functions"

Ist Teil von

• IEEE transactions on computer-aided design of integrated circuits and systems, 2000-11, Vol.19 (11), p.1386-1388

Ort / Verlag

IEEE

Erscheinungsjahr

2000

Link zum Volltext

• IEEE_Xplore

Quelle

IEEE/IET Electronic Library (IEL)

Beschreibungen/Notizen

• The above paper finds an optimal fixed-polarity Reed-Muller expansion of an n-variable totally symmetric function using an OFDD-based algorithm that requires O(n/sup 7/) time and O(n/sup 6/) storage space. However, an algorithm based on Suprun's transient triangles requires only O(n/sup 3/) time and O(n/sup 2/) storage space. An implementation of this algorithm yields computation times lower by several orders of magnitude.