Image de couverture de livre

Boolean Functions with Minimal Spectral Sensitivity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Prūsis, Krišjānis, Vihrovs, Jevgēnijs
Format:	Preprint
Publié:	2024
Sujets:	Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Spectral Norm, Economical Sieve, and Linear Invariance Testing of Boolean Functions
par: Datta, Swarnalipa, et autres
Publié: (2023)

Quantum Search on Computation Trees
par: Vihrovs, Jevgēnijs
Publié: (2025)

Special Coverings of Sets and Boolean Functions
par: Margaryan, Stepan
Publié: (2024)

Local Correction of Linear Functions over the Boolean Cube
par: Amireddy, Prashanth, et autres
Publié: (2024)

On the Rational Degree of Boolean Functions and Applications
par: Iyer, Vishnu, et autres
Publié: (2023)

Exact versus Approximate Representations of Boolean Functions in the De Morgan Basis
par: Chattopadhyay, Arkadev, et autres
Publié: (2025)

On the Number of Quantifiers Needed to Define Boolean Functions
par: Carmosino, Marco, et autres
Publié: (2024)

On the Approximate Non-Deterministic Degree of Total Boolean Functions
par: Pednekar, Samruddhi, et autres
Publié: (2026)

Instance complexity of Boolean functions
par: Liu, Alison Hsiang-Hsuan, et autres
Publié: (2023)

Quantum algorithms for Hopcroft's problem
par: Andrejevs, Vladimirs, et autres
Publié: (2024)

Following Forrelation -- Quantum Algorithms in Exploring Boolean Functions' Spectra
par: Dutta, Suman, et autres
Publié: (2021)

Nearest Neighbor Complexity and Boolean Circuits
par: DiCicco, Mason, et autres
Publié: (2024)

The Algebraic Cost of a Boolean Sum
par: Orzel, Ian, et autres
Publié: (2025)

On Boolean PCSPs with Polynomial Threshold Polymorphisms
par: Michno, Katzper
Publié: (2025)

Inverse Intersections for Boolean Satisfiability Problems
par: Homer, Paul W.
Publié: (2025)

Boolean PCSPs through the lens of Fourier Analysis
par: Banakh, Demian, et autres
Publié: (2026)

Low Degree Local Correction Over the Boolean Cube
par: Amireddy, Prashanth, et autres
Publié: (2024)

Boolean Circuit Complexity and Two-Dimensional Cover Problems
par: Cavalar, Bruno P., et autres
Publié: (2025)

VC-Dimension vs Degree: An Uncertainty Principle for Boolean Functions
par: Chang, Fan, et autres
Publié: (2025)

Boolean functions on high-dimensional expanders
par: Dikstein, Yotam, et autres
Publié: (2018)

Heuristics Optimization of Boolean Circuits with application in Attribute Based Encryption
par: Ionita, Alexandru, et autres
Publié: (2023)

Range Avoidance in Boolean Circuits via Turan-type Bounds
par: Kuntewar, Neha, et autres
Publié: (2025)

On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
par: Devillers, Raymond, et autres
Publié: (2022)

Complex Boolean Turing Machines: An Algebraic Semantic Framework for Computational Complexity
par: Zheng, Bojin, et autres
Publié: (2026)

A Near-Optimal Polynomial Distance Lemma Over Boolean Slices
par: Amireddy, Prashanth, et autres
Publié: (2025)

The 2CNF Boolean Formula Satisfiability Problem and the Linear Space Hypothesis
par: Yamakami, Tomoyuki
Publié: (2017)

The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs
par: Fischer, Nick, et autres
Publié: (2025)

Certifiable Boolean Reasoning Is Universal
par: Li, Wenhao, et autres
Publié: (2026)

Expected Shapley-Like Scores of Boolean Functions: Complexity and Applications to Probabilistic Databases
par: Karmakar, Pratik, et autres
Publié: (2024)

Query complexity of Boolean functions on the middle slice of the cube
par: Gerbner, Dániel, et autres
Publié: (2023)

Classification of Non-redundancy of Boolean Predicates of Arity 4
par: Brakensiek, Joshua, et autres
Publié: (2026)

Hardness of Learning Boolean Functions from Label Proportions
par: Guruswami, Venkatesan, et autres
Publié: (2024)

Dual-Tape Perspective and Generator Independence: The Algebraic Foundation of Real Boolean Turing Machines
par: Zheng, Jingwen, et autres
Publié: (2026)

Polynomial Calculus sizes over the Boolean and Fourier bases are incomparable
par: Mouli, Sasank
Publié: (2024)

Model Counting for Dependency Quantified Boolean Formulas
par: Fung, Long-Hin, et autres
Publié: (2025)

Logics with probabilistic team semantics and the Boolean negation
par: Hannula, Miika, et autres
Publié: (2023)

Size Minimization For Multi-Output AND-Functions
par: Armbruster, Susanne
Publié: (2024)

Solving Quantified Boolean Formulas with Few Existential Variables
par: Eriksson, Leif, et autres
Publié: (2024)

Revealing the canalizing structure of Boolean functions: Algorithms and applications
par: Dimitrova, Elena, et autres
Publié: (2021)

Complexity of Boolean automata networks under block-parallel update modes
par: Perrot, Kévin, et autres
Publié: (2024)