On the complexity of designing optimal branch-and-combine clock networks
From MaRDI portal
Publication:4571451
DOI10.1109/12.664212zbMath1392.68069OpenAlexW2148237740MaRDI QIDQ4571451
Priyalal D. Kulasinghe, Ahmed El-Amawy
Publication date: 9 July 2018
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/12.664212
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)
This page was built for publication: On the complexity of designing optimal branch-and-combine clock networks