On the complexity of allocation problems in high-level synthesis

DOI10.1016/0167-9260(94)90002-7zbMATH Open0875.68025OpenAlexW2059443248MaRDI QIDQ4332004

Klaus Jansen

Publication date: 27 February 1997

Published in: Integration (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-9260(94)90002-7

zbMATH Keywords

ColoringAllocation

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (1)

The allocation problem in hardware design

This page was built for publication: On the complexity of allocation problems in high-level synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332004)