The complexity of modular decomposition of boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Efficient SAT-based Boolean matching for FPGA technology mapping
Proceedings of the 43rd annual Design Automation Conference
Bi-decomposing large Boolean functions via interpolation and satisfiability solving
Proceedings of the 45th annual Design Automation Conference
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Cybernetics and Systems Analysis
Logic synthesis based on decomposition for CPLDs
Microprocessors & Microsystems
The complexity of modular decomposition of Boolean functions
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A relational approach to functional decomposition of logic circuits
ACM Transactions on Database Systems (TODS)
Decomposition of systems of Boolean functions determined by binary decision diagrams
Journal of Computer and Systems Sciences International
Decomposition-based logic synthesis for PAL-based CPLDs
International Journal of Applied Mathematics and Computer Science
Reduction in the number of LUT elements for control units with code sharing
International Journal of Applied Mathematics and Computer Science
On memory capacity to implement logic functions
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part II
New & improved models for SAT-based bi-decomposition
Proceedings of the great lakes symposium on VLSI
Evolutionary optimization of decomposition strategies for logical functions
SIDE'12 Proceedings of the 2012 international conference on Swarm and Evolutionary Computation
PPAM'11 Proceedings of the 9th international conference on Parallel Processing and Applied Mathematics - Volume Part I
| Hi-index | 0.00 |