Efficient NPN Classification for Large Functions using Graph Neural Network
This story is from 2026-11-04. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2611.00339v1 Announce Type: new Abstract: Two Boolean functions are considered NPN equivalent if one can be transformed into the other by negating inputs, permuting inputs, or negating the output. Efficient NPN classification is valuable in fields such as logic synthesis, quantum computing, a…
Read the full story at arXiv cs.AI ↗
Timeline · 1 report
- 2026-11-04 05:00 · arXiv cs.AI
Efficient NPN Classification for Large Functions using Graph Neural Network