[VLSI CAD] Why Optimization is Hard: NP-hard, heuristic, AI EDA

Impossible d'ajouter des articles

Désolé, nous ne sommes pas en mesure d'ajouter l'article car votre panier est déjà plein.

Veuillez réessayer plus tard

Veuillez réessayer plus tard

Écouter gratuitement

Voir les détails

https://www.vlsi.kr/

Many of the core optimization problems in semiconductor design are NP-hard / NP-Complete / PSPACE-complete, so algorithms that guarantee an "optimal solution" are virtually unprofitable at scale (e.g., even if there are only 40 cases of 2, there are 1 trillion cases)
This is why EDA tools are designed from the ground up to be heuristic + approximation + iterative improvement. This is not because "the tools suck," but because of the problem nature.
AI/ML does not efficiently find "optimal" solutions to NP-hard problems. Instead, they actually benefit by guiding, automating, and narrowing the problem with models.

Bénéficiez automatiquement de 2 livres audio offerts.
Bonne écoute !

Aucun commentaire pour le moment