COMPLEXITY OF THE LOOKUP-TABLE MINIMIZATION PROBLEM FOR FPGA TECHNOLOGY MAPPING

Authors
ZHANG SJ MILLER DM MUZIO JC
Citation
Sj. Zhang et al., COMPLEXITY OF THE LOOKUP-TABLE MINIMIZATION PROBLEM FOR FPGA TECHNOLOGY MAPPING, IEEE transactions on computer-aided design of integrated circuits and systems, 15(12), 1996, pp. 1588-1590
Citations number
2
Categorie Soggetti
Computer Application, Chemistry & Engineering","Computer Science Hardware & Architecture
Journal title
IEEE transactions on computer-aided design of integrated circuits and systems → ACNP
ISSN journal
02780070
Volume
15
Issue
12
Year of publication
1996
Pages
1588 - 1590
Database
ISI
SICI code
0278-0070(1996)15:12<1588:COTLMP>2.0.ZU;2-T
Abstract
In this paper, we prove that 3-RLMP and 4-RLMP, proposed by Farrahi an d Sarrafzadeh in the the above paper(1) are NP-complete.