The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, the optimization of pseudo-Boolean functions is considered. Boolean variables are expressed into their vector form. Using semi-tensor product, the pseudo-Boolean function is expressed as its normal form and algebraic form. Based on the normal form, we discuss the optimal approximation problem of pseudo-Boolean function.
The concept of canalizing Boolean function is generalized to multi-input multi-output canalizing Boolean mapping. Using the semi-tensor product of matrices and the matrix expression of logical functions, an easily verifiable condition is provided for testing whether a Boolean mapping is a canalizing Boolean mapping. Using it, the disturbance decoupling problem (DDP) of Boolean control networks is...
In this paper, we adopt an efficient data structure called the binary decision diagram (BDD) that exploits the structure displayed in quantum computing to simulate Grover's quantum search algorithm. First we adapt the original BDD and implement a series of algorithms to represent and manipulate matrices and vectors. Then instances of Grover's algorithm are simulated using our programme written in...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.