On the complexity of permutation network design

  • Authors:

  • Siroos K. Afshar

  • Affiliations:

  • Louisiana State University, Baton Rouge, Louisiana

  • Venue:
  • ACM SIGACT News
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem addressed is: Given a set of permutations of n objects, design a network consisting of 2-state switches which realizes the given permutations, and in which the number of switches is minimal. A general standard form for feedback-free permutation networks is proposed and used to formulate the problem mathematically. The complexity of an algorithm to solve the problem is studied, and it is shown that there is evidence to suspect that the problem is in the class NPNP.