Asset Details
Do you wish to reserve the book?
Complexity of XOR/XNOR boolean functions: a model using binary decision diagrams and back propagation neural networks
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Complexity of XOR/XNOR boolean functions: a model using binary decision diagrams and back propagation neural networks
Do you wish to request the book?
Complexity of XOR/XNOR boolean functions: a model using binary decision diagrams and back propagation neural networks
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Complexity of XOR/XNOR boolean functions: a model using binary decision diagrams and back propagation neural networks
2007
Overview
This paper proposes a model that predicts the complexity of Boolean functions with only XOR/XNOR min-terms using back propagation neural networks (BPNNs) applied to Binary Decision Diagrams (BDDs). The BPNN model (BPNNM) is developed through the training process of experimental data already obtained for XOR/XNOR-based Boolean functions. The outcome of this model is a unique matrix for the complexity estimation over a set of BDDs derived from Boolean expressions with a given number of variables and XOR/XNOR min-terms. The comparison results of the experimental and BPNNM underline the efficiency of this approach, which is capable of providing some useful clues about the complexity of the circuit to be implemented. It also proves the computational capabilities of NNs in providing reliable classification of the complexity of Boolean functions.
Publisher
Universidad Nacional de la Plata, Journal of Computer Science and Technology,Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
