20 results for “Boolean functions”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
Claude Carlet, Marko Čupić, Marko Ðurasevic, Domagoj Jakobovic +2 more
The paper investigates the ability of evolutionary computation to discover monotone Boolean functions with high nonlinearity, demonstrating that genetic programming is a highly effective encoding for…
The authors prove several inequalities for Boolean functions, establishing the Fourier Entropy-Influence conjecture for plateaued and partially bent functions.
One clear sentence describing what this paper does
The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.
This paper develops a geometric interpretation for the specification number of Boolean threshold functions and evaluates the average specification number, settling a question in the field.
Yinglong Gan, Jintao Yu, Shenggang Ying, Yusen Li +1 more
This paper proposes XBDD, a highly optimized ROBDD that reduces node count by merging nodes with local polarity differences.
This paper presents exact quantum algorithms for block compositions of total Boolean functions.
The paper provides a runtime analysis of Cartesian Genetic Programming (CGP) for evolving Boolean functions and proves asymptotic bounds for the expected number of fitness evaluations.
This paper introduces a local-to-global method for analyzing low influence functions on simplicial complexes and proves a local-to-global KKL-type Theorem.
The paper systematically explores a vast design space of cryptographic Boolean networks by formalizing six structural constraints, finding that optimal designs result from sparse, mutually compatible…
This paper proves lower bounds on the number of recursive calls made by two algorithms for monotone Boolean duality testing.
This paper presents a method to decompose the dynamics of Boolean networks into modules using an algebraic framework.
This paper unconditionally proves the Orthogonal Vectors and Monotone Orthogonal Vectors conjectures in concrete computational models, and provides stronger lower bounds for Boolean formulas and branc…
This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.
This paper proves a new lower bound of $ ildeΩ(n^2)$ for read-once parity branching programs on boolean functions, improving upon the previous bound of $ ildeΩ(n^{1.5})$.
This paper improves the upper bound for the (μ+1) EA on the Binary Value function BinVal.