Results 1 to 10 of about 9,542 (233)
Partial Boolean Functions With Exact Quantum Query Complexity One [PDF]
Entropy, 2021 We provide two sufficient and necessary conditions to characterize any n-bit partial Boolean function with exact quantum query complexity 1. Using the first characterization, we present all n-bit partial Boolean functions that depend on n bits and can be
Guoliang Xu, Daowen Qiu
doaj +3 more sources
On the Classes of Boolean Functions Generated by Maximal Partial Ultraclones
Известия Иркутского государственного университета: Серия "Математика", 2019 The sets of multifunctions are considered. A multifunction on a finite set $A$ is a function defined on the set $A$ and taking its subsets as values. Obviously, superposition in the usual sense does not work when working with multifunctions.
S.A. Badmaev
doaj +3 more sources
Informatika, 2023 Objectives. The problem of circuit implementation of incompletely specified (partial) k-valued logic functions given by tabular representations is considered.
P. N. Bibilo
doaj +1 more source
Кібернетика та комп'ютерні технології, 2022 Introduction. The application of binary-reflected (mirror, reflexive) Gray codes for solving combinatorial problems with pseudo-Boolean functions (polynomials from Boolean variables) is considered.
Oleksandr Trofymchuk +4 more
doaj +1 more source
A heuristic method for bi-decomposition of partial Boolean functions
Informatika, 2020 The problem of decomposition of a Boolean function is to represent a given Boolean function in the form of a superposition of some Boolean functions whose number of arguments are less than the number of given function.
Yu. V. Pottosin
doaj +1 more source
The complexity of pseudo-Kronecker and free-Kronecker forms of functions over finite fields
Учёные записки Казанского университета: Серия Физико-математические науки, 2020 An approach enabling partial generalization of the Green–Sasao hierarchy for polynomial forms of Boolean functions to the case of an arbitrary finite field was introduced.
A.S. Baliuk
doaj +1 more source
Advances and Challenges for Model and Data Engineering [PDF]
Journal of Universal Computer Science, 2021 Following the stimulating discussions in the workshops held during the 9th International Conference on Model and Data Engineering (MEDI 2019), we proposed to edit a special issue compiling the fruitful research resulting from those discussions.
Christian Attiogbé +2 more
doaj +3 more sources
Decomposability of partially defined Boolean functions
Discrete Applied Mathematics, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boros, Endre +4 more
openaire +2 more sources
Boolean Differentiation Equations Applicable in Reconfigurable Computational Medium
MATEC Web of Conferences, 2016 High performance computing environment synthesis with parallel architecture reconstructing throughout the process itself is described. Synthesized computational medium involving Boolean differential equation calculations so as to function in real-time ...
Shidlovskiy Stanislav
doaj +1 more source
BMC Medical Informatics and Decision Making, 2022 Background One of the most prevalent complications of Partial Nephrectomy (PN) is Acute Kidney Injury (AKI), which could have a negative impact on subsequent renal function and occurs in up to 24.3% of patients undergoing PN. The aim of this study was to
Teddy Lazebnik +3 more
doaj +1 more source