Search Results - monotone boolean function complexity*

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

“…This paper addresses the problem of completely reconstructing deterministic monotone Boolean functions via membership queries…”
Get full text

On the readability of monotone Boolean formulae by 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…”
Get full text

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

Get full text

On the Implementation of Monotone Boolean Functions by Memoryless Programs by 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…”
Get full text

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

Get full text

Guided inference of nested monotone Boolean functions by 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…”
Get full text

The Exact Circuit Complexity of Boolean Functions in an Infinite Basis by 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…”
Get full text

Exact Value of the Nonmonotone Complexity of Boolean Functions by 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…”
Get full text

On the complexity of hazard-free circuits by 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…”
Get full text

Approximating the Influence of a monotone Boolean function in O(\sqrt{n}) query complexity by 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…”
Get full text

On a Relation Between the Depth and Complexity of Monotone Boolean Formulas by 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…”
Get full text

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits by 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…”
Get full text

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

“… The result is used to estimate the complexity of approximate computation of an arbitrary monotone Boolean function of n variables…”
Get full text

Formula Complexity of a Linear Function in a -ary Basis by 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…”
Get full text

Totally Optimal Decision Trees for Monotone Boolean Functions with at Most Five Variables by 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…”
Get full text

Instance complexity of Boolean functions by Alison Hsiang-Hsuan Liu, Mande, Nikhil S

“…In the area of query complexity of Boolean functions, the most widely studied cost measure of an algorithm is the worst-case number of queries made by it on…”
Get full text

On the Approximation Method and the P versus NP Problem by Blum, Norbert

“… \(\not=\) NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the non-monotone complexity of suitable Boolean functions in NP or to understand why this is not…”
Get full text

On the complexity of terminal stuck-at fault detection tests for monotone Boolean functions by Vardanian, V.A.

“… monotone Boolean functions of n variables.< >…”
Get full text

Improved Lower Bounds for Monotone q-Multilinear Boolean Circuits by 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…”
Get full text

On the Complexity of Hazard-Free Formulas by Leah London Arazi, Shpilka, Amir

“…This paper studies the hazard-free formula complexity of Boolean functions. As our main result, we prove that unate functions are the only Boolean functions…”
Get full text