A Grover-Meets-Simon Approach to Match Vector Boolean Functions
The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables. Its solution is a fundamental step in the electronic design automation (EDA) tool chains commonly used for digital...
Saved in:
| Main Authors: | Marco Venere, Alessandro Barenghi, Gerardo Pelosi |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Transactions on Quantum Engineering |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/11108706/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Bandwidth limitations matching of electrically-small whip antennas with non-foster network
by: A. A. Golovkov, et al.
Published: (2016-04-01) -
Investigation of negative capacity converters for broad-band matching of electrically-small antennas
by: D. V. Belenko, et al.
Published: (2015-08-01) -
Logical optimization of Boolean nets using Shannon expansion
by: P. N. Bibilo, et al.
Published: (2019-06-01) -
Boolean independent sequences and Bourgain-Rosenthal’s theorem (in Ukrainian)
by: V. V. Mykhaylyuk
Published: (2012-05-01) -
Short Paper - The Binary Linearization Complexity of Pseudo-Boolean Functions
by: Walter, Matthias
Published: (2024-10-01)