Improving Rearrangeable Networks: A Quest for Optimal Control Complexity: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:1414:14, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,704 bytes +1,704‎ Created page with "Title: Improving Rearrangeable Networks: A Quest for Optimal Control Complexity Research Question: Can we design a rearrangeable network that optimally routes every permutation with minimal control complexity, improving upon the standard Benes network? Methodology: We propose a novel network called the KR-Benes, which is permutation-specific and control-optimal. We first design a restricted network called the K-Benes for optimally routing K-bounded permutations with co..."
Retrieved from "https://simplesci.org/wiki/Improving_Rearrangeable_Networks:_A_Quest_for_Optimal_Control_Complexity"