Some new results in the complexity of allocation and binding in data path synthesis

DOI10.1016/S0898-1221(98)00076-5zbMath1003.68726MaRDI QIDQ1608404

C. A. Mandal, Partha Pratim Chakrabarti, Sujoy Ghose

Publication date: 6 August 2002

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

allocationbinding problemsdata path synthesis

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Mathematical problems of computer architecture (68M07)

Cites Work

• The complexity of optimization problems
• On the hardness of approximating minimization problems

This page was built for publication: Some new results in the complexity of allocation and binding in data path synthesis