Comments on Sympathy: Fast Exact Minimization of Fixed Polarity Reed-Muller Expansion for Symmetric Functions

Abstract

The above paper finds an optimal fixed-polarity Reed-Muller expansion of an eta-variable totally symmetric function using an OFDD-based algorithm that requires O(n7) time and O(n6) storage space. However, an algorithm based on Suprun's transeunt triangles requires only O(n3) time and O(n2) storage space. An implementation of this algorithm yields computation times lower by several orders of magnitude.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 2000
Accession Number
ADA608089

Entities

People

  • Gerhard W. Dueck
  • Jon T. Butler
  • Svetlana Yanuskevich
  • Vlad P. Shmerko

Organizations

  • Naval Postgraduate School

Tags

Communities of Interest

  • Advanced Electronics
  • C4I

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Circuits
  • Coefficients
  • Computations
  • Computer Science
  • Computer-Aided Design
  • Computers
  • Engineering
  • Information Operations
  • Integrated Circuits
  • New Brunswick
  • Polarity
  • Sequences
  • Time Intervals
  • Triangles

Readers

  • Computer Programming and Software Development.
  • Statistical inference.

Technology Areas

  • Space