Výsledky vyhľadávania - (( Key yorks. boolean function complexity ) OR ( key work. boolean function complexity ))

Lifting Dichotomies.

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

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

Deep neural networks have an inbuilt Occam's razor.

Autori: Mingard, Chris Rees, Henry Valle-Pérez, Guillermo a ďalší

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

Predmety: ARTIFICIAL neural networks, SUPERVISED learning, ERROR functions, BOOLEAN functions, ALGORITHMS

COMPUTATIONAL COMPLEXITY OF MINIMAL TRAP SPACES IN BOOLEAN NETWORKS.

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

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

Predmety: BOOLEAN networks, BOOLEAN functions, POLYNOMIAL time algorithms, STATISTICAL decision making, DYNAMICAL systems, 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.

Autori: Kumar, Sunil Chaudhary, Dharminder Lakshmanan, S. A. a ďalší

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

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

On the Fine-Grained Query Complexity of Symmetric Functions.

Autori: Podder, Supartha Yao, Penghui Ye, Zekun

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

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

Autori: JANSSON, JULIA JANSSON, PATRIK

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

Predmety: BOOLEAN functions, DIGITAL electronics, POLYNOMIALS

Matrix discrepancy and the log-rank conjecture.

Autori: Sudakov, Benny Tomon, István

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

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

Paradigms for Unconditional Pseudorandom Generators.

Autori: Hatami, Pooya Hoza, William

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

Predmety: POLYNOMIALS, BOOLEAN functions, FOURIER analysis, FINITE fields, COMPLEXITY (Philosophy)

On the algebraic immunity—resiliency trade-off, implications for Goldreich's pseudorandom generator.

Autori: Dupin, Aurélien Méaux, Pierrick Rossi, Mélissa

Zdroj: Designs, Codes & Cryptography; Sep2023, Vol. 91 Issue 9, p3035-3079, 45p

Predmety: BOOLEAN functions

ON THE PROBABILISTIC DEGREES OF SYMMETRIC BOOLEAN FUNCTIONS.

Autori: SRINIVASAN, SRIKANTH TRIPATHI, UTKARSH VENKITESH, S.

Zdroj: SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 3, p2070-2092, 23p

Predmety: BOOLEAN functions, SYMMETRIC functions, POLYNOMIALS, COMPUTATIONAL complexity

Detecting Affine Equivalence Of Boolean Functions And Circuit Transformation.

Autori: Zeng, Xiao Yang, Guowu Song, Xiaoyu a ďalší

Zdroj: Computer Journal; Sep2023, Vol. 66 Issue 9, p2220-2229, 10p

Predmety: BOOLEAN functions, LOGIC circuits, ORTHONORMAL basis, APPLICATION software, COMPUTER science

On cryptographic properties of cubic and splitting Boolean functions.

Autori: Musukwa, Augustine Sala, Massimiliano Villa, Irene a ďalší

Zdroj: Applicable Algebra in Engineering, Communication & Computing; Sep2024, Vol. 35 Issue 5, p629-645, 17p

Predmety: BOOLEAN functions

Algorithm 1052: Evaluating a Boolean Polynomial on All Possible Inputs.

Autori: BOUILLAGUET, CHARLES

Zdroj: ACM Transactions on Mathematical Software; Dec2024, Vol. 50 Issue 4, p1-37, 37p

Predmety: GRAY codes, BOOLEAN functions, CRYPTOGRAPHY, POLYNOMIALS, ALGORITHMS

LOWER AND UPPER BOUNDS ON THE RANDOMNESS COMPLEXITY OF PRIVATE COMPUTATIONS OF AND.

Autori: KUSHILEVITZ, EYAL OSTROVSKY, RAFAIL PROUFF, EMMANUEL a ďalší

Zdroj: SIAM Journal on Discrete Mathematics; 2021, Vol. 35 Issue 1, p465-484, 20p

Predmety: BOOLEAN functions, LOGIC circuits, CIRCUIT complexity, BLOCK designs

Geografický termín: THAILAND

INFLUENCE OF A SET OF VARIABLES ON A BOOLEAN FUNCTION.

Autori: BISWAS, ANIRUDDHA SARKAR, PALASH

Zdroj: SIAM Journal on Discrete Mathematics; 2023, Vol. 37 Issue 3, p2148-2171, 24p

Predmety: BENT functions, BOOLEAN functions, COMPUTER science

Geografický termín: VANCOUVER (B.C.), BETHESDA (Md.)

Korporácia: IEEE Computer Society

Secure two-party computation via measurement-based quantum computing.

Autori: Rahmani, Zeinab Pinto, Armando Humberto Moreira Nolasco Barbosa, Luis Manuel Dias Coelho Soares

Zdroj: Quantum Information Processing; Jun2024, Vol. 23 Issue 6, p1-15, 15p

Predmety: QUANTUM computing, BOOLEAN functions, QUANTUM computers

Communication is Bounded by Root of Rank.

Autori: LOVETT, SHACHAR

Zdroj: Journal of the ACM; Feb2016, Vol. 63 Issue 1, p1:1-1:9, 9p

Predmety: LOG-rank test, RANKING (Statistics), BOOLEAN functions, GRAPH theory, QUADRATIC equations

A NEARLY OPTIMAL LOWER BOUND ON THE APPROXIMATE DEGREE OF AC⁰.

Autori: BUN, MARK THALER, JUSTIN

Zdroj: SIAM Journal on Computing; 2020, Vol. 49 Issue 4, p59-96, 38p

Predmety: BOOLEAN functions, LOGIC circuits, CIRCUIT complexity, QUANTUM communication, POLYNOMIAL approximation, POLYNOMIALS

Private Function Evaluation with Cards.

Autori: Koch, Alexander Walzer, Stefan

Zdroj: New Generation Computing; Apr2022, Vol. 40 Issue 1, p115-147, 33p

Predmety: TURING machines, BOOLEAN functions, RANDOM access memory, CRYPTOGRAPHY, PERMUTATIONS, KEY agreement protocols (Computer network protocols)

Non-singular sequence folding-based pseudorandom key generation algorithm for cryptographic processor.

Autori: Pandian, K. K. Soundra Ray, Kailash Chandra

Zdroj: Security & Communication Networks; Dec2015, Vol. 8 Issue 18, p4019-4027, 9p

Predmety: DE Bruijn graph, PSEUDONOISE sequences (Digital communications), CRYPTOGRAPHY, DATA security, BOOLEAN functions