Results 11 to 20 of about 51,964 (308)
Hybrid tabu search algorithm for excellent Boolean function [PDF]
Tongxin xuebao, 2022 Boolean function in symmetric cryptographic algorithm must satisfy excellent cryptographic criteria to ensure the security of the algorithm.By combining the advantages of tabu search algorithm and hill climbing algorithm, a new heuristic generation ...
Weiqiong WANG +3 more
doaj +5 more sources
Quantum algorithms for testing and learning Boolean functions [PDF]
, 2013 We discuss quantum algorithms based on the Bernstein-Vazirani algorithm for finding which input variables a Boolean function depends on. There are 2(n) possible linear Boolean functions of n input variables; given a linear Boolean function, the Bernstein-
Floess, Dominik +2 more
core +1 more source
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula.
Lijun Zhang +9 more
core +1 more source
Inference of a probabilistic Boolean network from a single observed temporal sequence [PDF]
, 2007 The inference of gene regulatory networks is a key issue for genomic signal processing. This paper addresses the inference of probabilistic Boolean networks (PBNs) from observed temporal sequences of network states.
Edward R. Dougherty +7 more
core +1 more source
The expressibility of functions on the Boolean domain, with applications to Counting CSPs [PDF]
, 2013 An important tool in the study of the complexity of Constraint Satisfaction Problems (CSPs) is the notion of a relational clone, which is the set of all relations expressible using primitive positive formulas over a particular set of base relations. Post'
Bulatov, AA +6 more
core +1 more source
An Algorithm for Minimization of Boolean Functions in the Class of Toffoli Reversible Logic Circuits [PDF]
Известия Иркутского государственного университета: Серия "Математика", 2018 In this paper, the problem of Boolean function's representation by the reversible circuits constructed of the Toffoli gates is considered. Interest in this problem is connected with actual studies of the possibility for realization of "cold" computations.
A.S. Frantseva
doaj +1 more source
Evolving sensitivity balances Boolean networks [PDF]
, 2012 We investigate the sensitivity of Boolean Networks (BNs) to mutations. We are interested in Boolean Networks as a model of Gene Regulatory Networks (GRNs). We adopt Ribeiro and Kauffman’s Ergodic Set and use it to study the long term dynamics of a BN. We
Turner, Matthew S. +9 more
core +1 more source
An Anytime Symmetry Detection Algorithm for ROBDDs [PDF]
, 2006 Detecting symmetries is crucial to logic synthesis, technology mapping, detecting function equivalence under unknown input correspondence, and ROBDD minimization. State-of-the-art is represented by Mishchenko's algorithm.
Kettle, Neil +3 more
core +1 more source
Algorithms, 2022 There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers.
Aleksey I. Pakhomchik +3 more
doaj +1 more source
Testing Boolean Functions Properties [PDF]
Fundamenta Informaticae, 2021 The goal in the area of functions property testing is to determine whether a given black-box Boolean function has a particular given property or is ɛ-far from having that property. We investigate here several types of properties testing for Boolean functions (identity, correlations and balancedness) using the Deutsch-Jozsa algorithm (for the Deutsch ...
Zhengwei Xie +4 more
openaire +3 more sources