Search Results - Key words. boolean function complexity*

Estimating the Number of Junta Variables for Optimizing Boolean Functions in Quantum Memories.

Authors: Alotaibi, Abdulaziz AbdelAzim, Samar Alharbi, Sattam Saleem et al.

Source: Mathematics (2227-7390); Nov2025, Vol. 13 Issue 21, p3400, 16p

Subject Terms: QUANTUM computing, TIME complexity, BOOLEAN functions, COMPUTER memory management, QUANTUM computers, QUANTUM entanglement

COMPUTATIONAL COMPLEXITY OF MINIMAL TRAP SPACES IN BOOLEAN NETWORKS.

Authors: KYUNGDUK MOON KANGBOK LEE PAULEVÉ, LOÏC

Source: SIAM Journal on Discrete Mathematics; 2024, Vol. 38 Issue 4, p2691-2708, 18p

Subject Terms: BOOLEAN networks, BOOLEAN functions, POLYNOMIAL time algorithms, STATISTICAL decision making, DYNAMICAL systems, COMPUTATIONAL complexity

Relations between energy complexity measures of Boolean networks and positive sensitivity of Boolean functions.

Authors: Mestetskiy, Mikhail A. Shupletsov, Mikhail S.

Source: Discrete Mathematics & Applications; Aug2024, Vol. 34 Issue 4, p211-219, 9p

Subject Terms: BOOLEAN networks, BOOLEAN functions, SWITCHING circuits, CIRCUIT complexity

HHL Algorithm for Tensor-Decomposable Matrices.

Authors: Pilaszewicz, Cezary Margraf, Marian

Source: Quantum Reports; Sep2025, Vol. 7 Issue 3, p37, 25p

Subject Terms: BOOLEAN functions, MATRIX inversion, TIME complexity, QUANTUM states, MATRIX decomposition, MOBIUS function, MATRICES (Mathematics)

THE APPROXIMATE DEGREE OF DNF AND CNF FORMULAS.

Authors: SHERSTOV, ALEXANDER A.

Source: SIAM Journal on Computing; 2025, Vol. 54 Issue 3, p702-774, 73p

Subject Terms: BOOLEAN functions, COMMUNICATION complexity (Information theory), DISJUNCTION (Logic), BOOLEAN expressions, LOGIC circuits, DISCRETE mathematics, COMPUTATIONAL complexity

Novel Approach to Degree, Balancedness, and Affine Equivalence of Boolean Functions and Construction of a Special Class of Non-Quadratic Balanced Boolean Functions.

Authors: Kumar, Sunil Chaudhary, Dharminder Lakshmanan, S. A. et al.

Source: Cryptography (2410-387X); Sep2025, Vol. 9 Issue 3, p56, 21p

Subject Terms: BOOLEAN functions, STREAM ciphers, NONLINEAR analysis, AFFINE transformations, MATHEMATICAL symmetry

On the Fine-Grained Query Complexity of Symmetric Functions.

Authors: Podder, Supartha Yao, Penghui Ye, Zekun

Source: Computational Complexity; Jun2025, Vol. 34 Issue 1, p1-77, 77p

CONSTANT DEPTH FORMULA AND PARTIAL FUNCTION VERSIONS OF MCSP ARE HARD.

Authors: ILANGO, RAHUL

Source: SIAM Journal on Computing; 2024, Vol. 53 Issue 6, p317-367, 51p

Subject Terms: CIRCUIT complexity, BOOLEAN functions, CRYPTOGRAPHY, HYPOTHESIS, MOTIVATION (Psychology)

An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree.

Authors: Ambainis, Andris Belovs, Aleksandrs

Source: Computational Complexity; Dec2025, Vol. 34 Issue 2, p1-25, 25p

The generalized complexity of linear Boolean functions.

Authors: Redkin, Nikolay P.

Source: Discrete Mathematics & Applications; Feb2020, Vol. 30 Issue 1, p39-44, 6p

Subject Terms: BOOLEAN functions, LOGIC circuits, CIRCUIT complexity

Construction of Even-Variable 2-Output Almost Optimal Five-Valued Spectra Boolean Functions.

Alternate Title: 偶变元二输出几乎最优五谱值布尔函数的构造. (Chinese)

Authors: Chao-Fan, SONG Yan-Han, JI Yu-Juan, SUN

Source: Journal of Cryptologic Research (2097-4116); Jun2025, Vol. 12 Issue 3, p714-728, 15p

Subject Terms: BOOLEAN functions, SPECTRAL theory, SCIENTIFIC method, CRYPTOGRAPHY

CMOS Synthesis of Multiple-Valued Multiple Threshold Functions– analysis and comparison.

Authors: Abd-El-Barr, Mostafa

Source: International Journal of Electronics; Sep2025, Vol. 112 Issue 9, p2066-2092, 27p

Subject Terms: COMPLEMENTARY metal oxide semiconductors, THRESHOLD logic, DESIGN techniques, BENCHMARK problems (Computer science), CIRCUIT complexity, SIMULATION Program with Integrated Circuit Emphasis, HEURISTIC algorithms

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions.

Authors: Ye, Ze-Kun Li, Lv-Zhou

Source: Journal of Computer Science & Technology (10009000); Dec2023, Vol. 38 Issue 6, p1423-1430, 8p

Subject Terms: BOOLEAN functions, SYMMETRIC functions, ALGORITHMS, QUANTUM computing

Lifting Dichotomies.

Authors: Alekseev, Yaroslav Filmus, Yuval Smal, Alexander V.

Source: Computational Complexity; Dec2025, Vol. 34 Issue 2, p1-53, 53p

Matrix discrepancy and the log-rank conjecture.

Authors: Sudakov, Benny Tomon, István

Source: Mathematical Programming; Jul2025, Vol. 212 Issue 1, p567-579, 13p

Subject Terms: SEMIDEFINITE programming, BOOLEAN functions, LOGICAL prediction, MATRICES (Mathematics)

A Note on the LogRank Conjecture in Communication Complexity.

Authors: Grolmusz, Vince

Source: Mathematics (2227-7390); Nov2023, Vol. 11 Issue 22, p4651, 10p

Subject Terms: COMPOSITE numbers, BOOLEAN matrices, LOGICAL prediction, BOOLEAN functions, COMPLEXITY (Philosophy)

Exact Value of the Nonmonotone Complexity of Boolean Functions.

Authors: Kochergin, V. V. Mikhailovich, A. V.

Source: Mathematical Notes; Jan2019, Vol. 105 Issue 1/2, p28-35, 8p

Subject Terms: BOOLEAN functions, LOGIC circuits, CIRCUIT complexity, VALUE chains

On the complexity of monotone circuits for threshold symmetric Boolean functions.

Authors: Sergeev, Igor S.

Source: Discrete Mathematics & Applications; Oct2021, Vol. 31 Issue 5, p345-366, 22p

Subject Terms: SYMMETRIC functions, BOOLEAN functions, CIRCUIT complexity

Efficiency and controllability of stochastic boolean function generation by a random network of non-linear nanoparticle junctions.

Authors: Martini, G. Tentori, E. Mirigliano, M. et al.

Source: Frontiers in Physics; 2024, p1-13, 13p

Subject Terms: BOOLEAN functions, NANOPARTICLES, BIOLOGICAL neural networks, GOLD films, SEARCH algorithms

Lower Bounds on Representing Boolean Functions as Polynomials in Z m

Authors: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Contributors: Shi-chun Tsai The Pennsylvania State University CiteSeerX Archives

Source: ftp://ftp.cs.uchicago.edu/pub/publications/tech-reports/TR-92-28.ps

Subject Terms: Key words. boolean function complexity, circuit complexity, computational complexity

File Description: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1087

Availability: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.54.1087