Sign inSubmit
Tips: “quotes” for a phrase · author:Lee · a DOI goes straight to its article

16 results for “Boolean function”
Set a search alert
Research ArticleOpen accessPhrase in the titleSingle Core Hardware Module to Implement Boolean Function Classification TechniquesMohd. Marufuzzaman, Md. Mamun, Fazidah Hanim Hashim, Labonnah F. RahmanProblem statement: Boolean function classification plays an important role in the field like technology mapping for digital circuit design, function mapping for minimization and the development of universal logic modules. Approach: In this study, we present a single core hardware module to implement Boolean function classification techniques on Altera FLEX10K FPGA device for lossless data compression. The compression algorithm was … …American Journal of Applied Sciences, Vol. 8, Issue 11 · 7 Oct 2011 · 7,408 accessesView PDFCite
Research ArticleOpen accessPhrase in the titleGeneralization of Boolean Functions Properties to Functions Defined over GF(p)Saad Elmansori, B. E. EsamProblem statement: Traditionally, cryptographic applications designed on hardware have always tried to take advantage of the simplicity of implementation functions over GF(p), p = 2, to reduce costs and improve performance. On the contrast, functions defined over GF(p); p > 2, possess far better cryptographic properties than GF(2) functions. Approach: We generalize some of the previous results on cryptographic Boolean … …Journal of Computer Science, Vol. 8, Issue 6 · 13 Mar 2012 · 7,436 accessesView PDFCite
Research ArticleOpen accessEvery word in the titleUsing Background Knowledge and Random Sampling in Genetic Programming: A Case Study in Learning Boolean Parity FunctionsLappoon R. TangThe Boolean even-N-parity function returns T (i.e., true) if an even number of its Boolean arguments for N arguments are T and otherwise returns NIL (i.e., false). Learning Boolean even-N-parity functions has been recognized as a difficult problem for evolutionary computation (such as genetic programming) especially when N is large (e.g., 20+). A number of approaches have been proposed for … …Journal of Computer Science, Vol. 19, Issue 7 · 10 Jul 2023 · 5,481 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn a Proof of Inequality of PvsNPAngelo Raffaele MeoThis study is a new version of a previous paper. Its purpose is to simplify some sections of the old version and, above all, to present the proofs of some theorems which had been omitted for the sake of brevity. The analysis discussed in this study and its previous version is based on a well-known NP-complete problem which is called … …Journal of Computer Science, Vol. 19, Issue 1 · 16 Jan 2023 · 7,531 accessesView PDFCite
Research ArticleOpen accessIn the keywordsOn the P VS NP Question: A New Proof of InequalityAngelo Raffaele MeoThe analysis discussed in this study is based on a well-known NP-complete problem which is called “satisfiability problem or SAT”. From SAT a new NP-complete problem derives, which is described by a Boolean function of the number n of the clauses of SAT called “core function”. In this study a new proof is presented according which the number of gates … …Journal of Computer Science, Vol. 17, Issue 5 · 27 May 2021 · 9,442 accessesView PDFCite
Research ArticleOpen accessIn the keywordsA Novel Fault Tolerant Reversible Gate For Nanotechnology Based SystemsMajid Haghparast, Keivan NaviThis paper proposes a novel reversible logic gate, NFT. It is a parity preserving reversible logic gate, that is, the parity of the outputs matches that of the inputs. We demonstrate that the NFT gate can implement all Boolean functions. It renders a wide class of circuit faults readily detectable at the circuit's outputs. The proposed parity preserving reversible gate, … …American Journal of Applied Sciences, Vol. 5, Issue 5 · 31 May 2008 · 7,904 accessesView PDFCite
Research ArticleOpen accessIn the keywordsEmpirical Analysis and Mathematical Representation of the Path Length Complexity in Binary Decision DiagramsA. Assi, P. W.C. Prasad, B. Mills, A. ElchouemiInformation about the distribution of path-lengths in a Binary Decision Diagrams (BDDs) representing Boolean functions is useful in determining the speed of hardware and software implementations of the circuit represented by these Boolean functions. This study presents expressions produced from an empirical analysis of a representative collection of Boolean functions. The Average Path Length (APL) and the Shortest Path Length … …Journal of Computer Science, Vol. 2, Issue 3 · 31 Mar 2006 · 6,814 accessesView PDFCite
Research ArticleOpen accessIn the keywordsBDD Path Length Minimization Based on Initial Variable OrderingP. W.C. Prasad, M. Raseen, A. Assi, S. M.N.A. SenanayakeA large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path … …Journal of Computer Science, Vol. 1, Issue 4 · 31 Dec 2005 · 6,504 accessesView PDFCite
Review ArticleOpen accessIn the abstractA Survey of Quadratization Methods Used in QUBO Formulations and their Usage in Quantum and Digital AnnealingGeethika Prabhath, Anuradha Mahasinghe, Nalin Ranasinghe, Kasun De ZoysaQuantum annealing is a metaheuristic method aimed at finding the global minimum of a pseudo-Boolean quadratic function. To solve a problem by a quantum annealer, it must be restated as a QUBO (quadratic unconstrained binary optimization) problem, the standard format acceptable to an annealer. However, there are many natural problems that turn out be of cubic or higher order, yet … …Journal of Computer Science, Vol. 22, Issue 1 · 16 Feb 2026 · 2,554 accessesView PDFCite
Research ArticleOpen accessIn the abstractCONSTRUCTION OF GENERAL SUBSUMPTIVE SOLUTIONS OF BOOLEAN EQUATIONS VIA COMPLETE-SUM DERIVATIONAli Muhammad Ali Rushdi, Hussain Mobarak AlbarakatiBoolean-equation solving permeates many diverse areas of modern science. To solve a system of Boolean equations, one usually combines them into an equivalent single Boolean equation {f(X) = 0} whose set of solutions is exactly the same as that of the original system of equations. One of the general classes of solutions for Boolean equations is the subsumptive general solution, … …Journal of Mathematics and Statistics, Vol. 10, Issue 2 · 13 Mar 2014 · 7,109 accessesView PDFCite