A New Lower Bound for the Number of Switches in Rearrangeable Networks

DOI10.1137/0601020zbMath0496.94019OpenAlexW2074504623MaRDI QIDQ3960605

Nicholas J. Pippenger

Publication date: 1980

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://scholarship.claremont.edu/hmc_fac_pub/140

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (4)

Generalized Infinite Products for Powers of <em>e</em>^1/<em>k</em> ⋮ Shorter arithmetization of nondeterministic computations ⋮ Some Graph-Colouring Theorems with Applications to Generalized Connection Networks ⋮ Rearrangeable Networks with Limited Depth

Cites Work

• Unnamed Item
• A short proof of Minc's conjecture
• Shifting Graphs and Their Applications
• Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices

This page was built for publication: A New Lower Bound for the Number of Switches in Rearrangeable Networks