Suchergebnisse - Key works. boolean function complexity

Proving as Fast as Computing: Succinct Arguments with Constant Prover Overhead.

Autoren: Ron-Zewi, Noga Rothblum, Ron

Quelle: Journal of the ACM. Apr2025, Vol. 72 Issue 2, p1-54. 54p.

Schlagwörter: LOGIC circuits, CIRCUIT complexity, FINITE fields, MULTIPLICATION, ARITHMETIC

Lifting Dichotomies.

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

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

THE APPROXIMATE DEGREE OF DNF AND CNF FORMULAS.

Autoren: SHERSTOV, ALEXANDER A.

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

Schlagwörter: BOOLEAN functions, COMMUNICATION complexity (Information theory), DISJUNCTION (Logic), BOOLEAN expressions, LOGIC circuits, DISCRETE mathematics, COMPUTATIONAL complexity

Deep neural networks have an inbuilt Occam's razor.

Autoren: Mingard, Chris Rees, Henry Valle-Pérez, Guillermo et al.

Quelle: Nature Communications; 1/14/2025, Vol. 16 Issue 1, p1-9, 9p

Schlagwörter: ARTIFICIAL neural networks, SUPERVISED learning, ERROR functions, BOOLEAN functions, ALGORITHMS

A Grover-Meets-Simon Approach to Match Vector Boolean Functions

Autoren: Marco Venere Alessandro Barenghi Gerardo Pelosi

Quelle: IEEE Transactions on Quantum Engineering, Vol 6, Pp 1-14 (2025)

Schlagwörter: Electronic design automation (EDA), negation–permutation–negation equivalence (NPN-equivalence), quantum-aided Boolean matching, Atomic physics. Constitution and properties of matter, QC170-197, Materials of engineering and construction. Mechanics of materials, TA401-492

Dateibeschreibung: electronic resource

Relation: https://ieeexplore.ieee.org/document/11108706/; https://doaj.org/toc/2689-1808

Zugangs-URL: https://doaj.org/article/d4586b99e24a4f488b828e1636d85830

HHL Algorithm for Tensor-Decomposable Matrices.

Autoren: Pilaszewicz, Cezary Margraf, Marian

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

Schlagwörter: BOOLEAN functions, MATRIX inversion, TIME complexity, QUANTUM states, MATRIX decomposition, MOBIUS function, MATRICES (Mathematics)

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

Autoren: ILANGO, RAHUL

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

Schlagwörter: CIRCUIT complexity, BOOLEAN functions, CRYPTOGRAPHY, HYPOTHESIS, MOTIVATION (Psychology)

A KEY EXCHANGE METHOD BASED ON BOOLEAN FUNCTIONS AS SUBSETS OF COLUMNS.

Autoren: ZGUREANU, AURELIU

Quelle: Competitiveness & Innovation in the Knowledge Economy (International Scientific Conference); 2022, p321-331, 11p

Schlagwörter: PUBLIC key cryptography, BOOLEAN functions, DERIVATIVES (Mathematics), SCIENCE publishing, ALGORITHMS

COMPUTATIONAL COMPLEXITY OF MINIMAL TRAP SPACES IN BOOLEAN NETWORKS.

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

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

Schlagwörter: BOOLEAN networks, BOOLEAN functions, POLYNOMIAL time algorithms, STATISTICAL decision making, DYNAMICAL systems, COMPUTATIONAL complexity

Expressing and Exploiting Subgoal Structure in Classical Planning Using Sketches.

Autoren: Drexler, Dominik Seipp, Jendrik Geffner, Hector

Quelle: Journal of Artificial Intelligence Research. 2024, Vol. 80, p171-208. 38p.

Schlagwörter: Decomposition method, Polynomial time algorithms, Boolean functions, Computational complexity, Domain-specific programming languages

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

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

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

Schlagwörter: BOOLEAN functions, STREAM ciphers, NONLINEAR analysis, AFFINE transformations, MATHEMATICAL symmetry

On the Fine-Grained Query Complexity of Symmetric Functions.

Autoren: Podder, Supartha Yao, Penghui Ye, Zekun

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

Disrupted Rhythms, Disrupted Microbes: A Systematic Review of Shift Work and Gut Microbiota Alterations.

Autoren: Grasa-Ciria, Diego Couto, Sergio Samatán, Eva et al.

Quelle: Nutrients. Sep2025, Vol. 17 Issue 17, p2894. 16p.

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

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

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

Schlagwörter: BOOLEAN functions, SYMMETRIC functions, ALGORITHMS, QUANTUM computing

The D10Z Resolution of the Boolean Sensitivity Conjecture: Computational Complexity as Fractal Coherence Geometry

Autoren: Al Thani, Jamil orcid:0009-0000-8858-

Relation: https://zenodo.org/records/15477350; oai:zenodo.org:15477350; https://doi.org/10.5281/zenodo.15477350

Verfügbarkeit: https://doi.org/10.5281/zenodo.15477350
https://zenodo.org/records/15477350

A Coding Theoretic Approach towards Symmetrization in Reversible Circuit Synthesis.

Autoren: BAKSI, ANUBHAB SARKAR, SUMANTA CHATTOPADHYAY, ANUPAM

Quelle: Journal of Multiple-Valued Logic & Soft Computing; 2020, Vol. 35 Issue 3/4, p239-262, 24p

Schlagwörter: BOOLEAN functions, LOGIC design, CIRCUIT complexity, SYMMETRIC functions, CODING theory

Paradigms for Unconditional Pseudorandom Generators.

Autoren: Hatami, Pooya Hoza, William

Quelle: Foundations & Trends in Theoretical Computer Science; 2024, Vol. 16 Issue 1/2, p1-210, 210p

Schlagwörter: POLYNOMIALS, BOOLEAN functions, FOURIER analysis, FINITE fields, COMPLEXITY (Philosophy)

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

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

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

Schlagwörter: BOOLEAN functions, NANOPARTICLES, BIOLOGICAL neural networks, GOLD films, SEARCH algorithms

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

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

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

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

Schlagwörter: BOOLEAN functions, SPECTRAL theory, SCIENTIFIC method, CRYPTOGRAPHY

Level-p-complexity of Boolean functions using thinning, memoization, and polynomials.

Autoren: JANSSON, JULIA JANSSON, PATRIK

Quelle: Journal of Functional Programming; 2023, Vol. 33, p1-21, 21p

Schlagwörter: BOOLEAN functions, DIGITAL electronics, POLYNOMIALS