Results 11 to 20 of about 76,534 (153)
Indistinguishable Sceneries on the Boolean Hypercube [PDF]
Combinatorics, Probability and Computing, 2018 We show that the scenery reconstruction problem on the Boolean hypercube is in general impossible. This is done by using locally biased functions, in which every vertex has a constant fraction of neighbours coloured by 1, and locally stable functions, in which every vertex has a constant fraction of neighbours coloured by its own colour.
RENAN GROSS, URI GRUPEL
openaire +5 more sources
Optimization Over the Boolean Hypercube Via Sums of Nonnegative Circuit Polynomials [PDF]
Foundations of Computational Mathematics, 2021 AbstractVarious key problems from theoretical computer science can be expressed as polynomial optimization problems over the boolean hypercube. One particularly successful way to prove complexity bounds for these types of problems is based on sums of squares (SOS) as nonnegativity certificates.
Mareike Dressler +2 more
openaire +9 more sources
Concentration on the Boolean hypercube via pathwise stochastic analysis [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 48 pages, 2 ...
Eldan, Ronen, Gross, Renan
openaire +4 more sources
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.
Xiao, Y. +3 more
core +3 more sources
Randomly twisted hypercubes -- between structure and randomness [PDF]
, 2023 Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al.
Dikstein, Yotam +3 more
core
Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion
Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023 We consider a variant of the classical notion of noise on the Boolean hypercube which gives rise to a new approach to inequalities regarding noise stability. We use this approach to give a new proof of the Majority is Stablest theorem by Mossel, O'Donnell, and Oleszkiewicz, improving the dependence of the bound on the maximal influence of the function ...
Ronen Eldan +2 more
openaire +5 more sources
nodef/extra-boolean: A collection of common boolean functions
, 2022 <p>A collection of common boolean functions.<br> <a href="https://www.npmjs.com/package/extra-boolean">Node.js</a>, <a href="https://www.npmjs.com/package/extra-boolean.web">Web</a>, <a href="https://unpkg.com ...
Subhajit Sahu, George Pickering
core +1 more source
An $o(n)$ Monotonicity Tester for Boolean Functions over the Hypercube [PDF]
SIAM Journal on Computing, 2013 A Boolean function $f:\{0,1\}^n \mapsto \{0,1\}$ is said to be $\varepsilon$-far from monotone if $f$ needs to be modified in at least $\varepsilon$-fraction of the points to make it monotone. We design a randomized tester that is given oracle access to $f$ and an input parameter $\varepsilon>0$ and has the following guarantee: It outputs \sf Yes if
Deeparnab Chakrabarty, C. Seshadhri 0001
openaire +6 more sources
Randomly twisted hypercubes: between structure and randomness [PDF]
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al.
Zhukovskii, M. +3 more
core +4 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