By Topic

Strongly NP-hard discrete gate-sizing problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wing Ning ; Dept. of Comput. Sci., Arkansas Univ., Fayetteville, AR

The discrete gate-sizing problem has been studied by several researchers recently. Some complexity results have been obtained, and a number of heuristic algorithms have been proposed. For circuit networks that are restricted to the set of trees, or series-parallel graphs, pseudo-polynomial time algorithms to obtain the exact solution have also been proposed, though none can be extended to circuit networks that are arbitrary directed acyclic graphs (dags), We prove that the problem is strongly NP-hard. Our result implies that for arbitrary dags, there is no pseudo-polynomial time algorithm to obtain the exact solution unless P=NP. We also prove that the absolute approximation discrete gate sizing problem is strongly NP-hard. These results provide insight into the difficulties of the problem and may lead to better heuristics

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:13 ,  Issue: 8 )