Výsledky vyhledávání - monotone boolean function complexity

On the readability of monotone Boolean formulae Autor Elbassioni, Khaled, Makino, Kazuhisa, Rauf, Imran

“…Golumbic et al. (Discrete Appl. Math. 154:1465–1477, 2006 ) defined the readability of a monotone Boolean function f to be the minimum integer k such that there…”
Získat plný text

On the Implementation of Monotone Boolean Functions by Memoryless Programs Autor Chashkin, A. V.

“…The average-case complexity of computing monotone Boolean functions by straight-line programs without memory with a conditional stop in the basis of all Boolean functions of at most two variables is considered…”
Získat plný text

The Monotone Circuit Complexity of Quadratic Boolean Functions Autor Amano, Kazuyuki, Maruoka, Akira

Získat plný text

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions Autor Torvik, Vetle I, Triantaphyllou, Evangelos

“…This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries…”
Získat plný text

The Monotone Circuit Complexity of Quadratic Boolean Functions Autor Akira Maruoka, Kazuyuki Amano

Získat plný text

Guided inference of nested monotone Boolean functions Autor Torvik, Vetle I, Triantaphyllou, Evangelos

“…This paper addresses the problem of minimizing the average query complexity of inferring a pair of nested monotone Boolean functions defined on {0,1…”
Získat plný text

Exact Value of the Nonmonotone Complexity of Boolean Functions Autor Kochergin, V. V., Mikhailovich, A. V.

“…We study the complexity of the realization of Boolean functions by circuits in infinite complete bases containing all monotone functions with zero weight (cost of use…”
Získat plný text

The Exact Circuit Complexity of Boolean Functions in an Infinite Basis Autor Kochergin, V. V., Mikhailovich, A. V.

“…The exact value of the complexity of the circuit implementation of an arbitrary Boolean function in a certain basis consisting of negation and all monotone Boolean functions is found…”
Získat plný text

Incomparable integrals and approximate calculation of monotone Boolean functions Autor Chashkin, A. V.

“… The result is used to estimate the complexity of approximate computation of an arbitrary monotone Boolean function of n variables…”
Získat plný text

On the complexity of hazard-free circuits Autor Ikenmeyer, Christian, Komarath, Balagopal, Lenzen, Christoph, Lysikov, Vladimir, Mokhov, Andrey, Sreenivasaiah, Karteek

“… to all (not necessarily monotone) Boolean functions. Thus, we can apply known monotone complexity lower bounds to find lower bounds on the hazard…”
Získat plný text

On a Relation Between the Depth and Complexity of Monotone Boolean Formulas Autor Sergeev, I. S.

“…We present a sequence of monotone Boolean functions whose depth over the basis {∧, ∨} is c > 1.06 times greater than the logarithm of the formula complexity…”
Získat plný text

Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity Autor Dana, Ron, Rubinfeld, Ronitt, Safra, Muli, Weinstein, Omri

“… We study the problem of approximating the total influence of a monotone Boolean function \ifnum\plusminus=1 \(f: \{\pm1\}^n \longrightarrow \{\pm1\}\), \else \(f: \bitset^n \to \bitset…”
Získat plný text

Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables Autor Chikalov, Igor, Hussain, Shahid, Moshkov, Mikhail

“…In this paper, we present the empirical results for relationships between time (depth) and space (number of nodes) complexity of decision trees computing monotone Boolean functions, with at most five variables…”
Získat plný text

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits Autor Sengupta, Rimli, Venkateswaran, H.

“…). This non-monotone Boolean function is known to be in P . In the spirit of monotone complexity classes, we define complexity classes based on non-cancellative Boolean circuits…”
Získat plný text

Formula Complexity of a Linear Function in a -ary Basis Autor Sergeev, I. S.

“… The resulting extension makes it possible to evaluate the complexity of linear Boolean functions and a majority function of variables when realized by formulas in the basis of all -ary monotone…”
Získat plný text

Joint realizability of monotone Boolean functions Autor Crawford-Kahrl, Peter, Cummins, Bree, Gedeon, Tomáš

“…The study of monotone Boolean functions (MBFs) has a long history. We explore a connection between MBFs and ordinary differential equation (ODE…”
Získat plný text

New theoretical results on the Monotone Boolean Duality and the Monotone Boolean Dualization problems Autor Raffaele, Alice, Rizzi, Romeo

“…This work presents a new decomposition for the Monotone Boolean Duality problem, which consists of checking whether two monotone Boolean functions f…”
Získat plný text

Study on Using Reinforcement Learning for the Monotone Boolean Reconstruction Autor Sahakyan, Hasmik, Katona, Gyula, Aslanyan, Levon

“…This paper investigates the feasibility of using reinforcement learning to solve combinatorial optimization problems, in particular, the problem of query-based monotone Boolean function reconstruction…”
Získat plný text

Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits Autor Lingas, Andrzej, Persson, Mia

“…A monotone Boolean circuit is composed of OR gates, AND gates and input gates corresponding to the input variables and the Boolean constants. It is \(q…”
Získat plný text

The Rivest–Vuillemin Conjecture on Monotone Boolean Functions Is True for Ten Variables Autor Gao, Sui-Xiang, Wu, Weili, Du, Ding-Zhu, Hu, Xiao-Dong

“… Rivest and Vuillemin conjectured that every nontrivial monotone weakly symmetric Boolean function is elusive…”
Získat plný text