ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Boolean functions”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.NEcs.CRApr 19, 2026

Monotone but Exciting: On Evolving Monotone Boolean Functions with High Nonlinearity

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…

View →
cs.ITmath.COTheoreticalRecentSep 18, 2026

On the Fourier Entropy-Influence Conjecture for Boolean Plateaued Functions

Vladimir N. Potapov

The authors prove several inequalities for Boolean functions, establishing the Fourier Entropy-Influence conjecture for plateaued and partially bent functions.

View →
cs.CCcs.LGEmpiricalRecentJun 15, 2026

Polynomial-Time Mistake-Bounded Language Generation

Héctor Jimenez, Alexander Kozachinskiy, Vicente Opazo

One clear sentence describing what this paper does

View →
cs.DScs.CCcs.ITTheoreticalRecentJun 9, 2026

A Unified Lower Bound on the Noisy Query Complexity of Boolean Functions

Yuzhou Gu, Xin Li, Yinzhan Xu

The paper provides a general lower bound on the noisy query complexity of Boolean functions in the noisy query model.

View →
cs.DMcs.LGmath.COTheoreticalRecentJun 28, 2026

Chamber geometry and specification numbers of Boolean threshold functions

Martin Anthony

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.

View →
cs.DSEmpiricalRecentSep 29, 2026

XBDD: A Highly Optimized ROBDD with Per-Edge Variable-Flip Maps

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.

View →
cs.CCquant-phTheoreticalRecentNov 12, 2026

Exact Quantum Algorithms for Composed Boolean Functions

Gagan Chiruvella, Chandrima Kayal, Rajat Mittal, Manaswi Paraashar +1 more

This paper presents exact quantum algorithms for block compositions of total Boolean functions.

View →
cs.NEcs.AIcs.LGTheoreticalRecentJun 14, 2026

Runtime Analysis of Cartesian Genetic Programming in Evolving Boolean Functions

Duc-Cuong Dang, Roman Kalkreuth, Andre Opris

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.

View →
math.COcs.CCcs.DMTheoreticalRecentJun 28, 2026

Toward a KKL Theorem for any HDX

Max Hopkins

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.

View →
cs.CRApr 30, 2026

SBN Explorer: An Empirical Study of Cryptographic Boolean Networks

Arnaud Valence

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…

View →
cs.CCcs.DSTheoreticalRecentOct 25, 2026

Unconditional Lower Bounds for the Fredman--Khachiyan Algorithms for Monotone Boolean Duality Testing

Khaled Elbassioni

This paper proves lower bounds on the number of recursive calls made by two algorithms for monotone Boolean duality testing.

View →
q-bio.QMcs.DMmath.RATheoreticalRecentJul 23, 2026

Dynamics Decomposition of Boolean Networks: An algebraic foundation

Alan Veliz-Cuba, Claus Kadelka, David Murrugarra, Matthew Wheeler +3 more

This paper presents a method to decompose the dynamics of Boolean networks into modules using an algebraic framework.

View →
cs.CCTheoreticalRecentJul 26, 2026

New and Improved Concrete Lower Bounds for Orthogonal Vectors

Tameem Choudhury, Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan

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…

View →
math.PRcs.DMcs.FLTheoreticalRecentJun 28, 2026

Note on Finite-Automata Bernoulli Factories for Rational Functions

Renato Paes Leme, Jon Schneider

This paper identifies a technical oversight in Mossel and Peres (2005) theorem on designing Bernoulli factories for multivariable functions and provides a counterexample.

View →
cs.CCTheoreticalRecentJul 7, 2026

A Lower Bound for Read-Once Parity Branching Programs

Ben Lee Volk

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})$.

View →
cs.NETheoreticalRecentJun 11, 2026

Improved Runtime Bound for the $(μ+ 1)$ EA on BinVal

Joris Belder, Johannes Lengler, Raghu Raman Ravi

This paper improves the upper bound for the (μ+1) EA on the Binary Value function BinVal.

View →