Suchergebnisse - key (((yorks. OR yorks.) OR yorks.) OR (work. OR york.)) boolean function complexity*

Privacy-Preserving Boolean Range Query With Temporal Access Control in Mobile Computing von Tong, Qiuyun, Li, Xinghua, Miao, Yinbin, Liu, Ximeng, Weng, Jian, Deng, Robert H.

“… ), massive spatio-textual data has been outsourced to cloud servers for storage and analysis such as spatial keyword search …”
Volltext

Minimum complexity drives regulatory logic in Boolean models of living systems von Subbaroyan, Ajay, Martin, Olivier C, Samal, Areejit

“… However, the Boolean functions (BFs) specifying the associated logical update rules should not be expected to be random …”
Volltext

Boolean semiring key-exchange with BLAKE3 security (BKEX-B3) von Alvary Kefas Kwala, Alpna Mishra, Shri Kant

“… This work presents a new Boolean Semiring Key Exchange Protocol combined with BLAKE3 cryptographic hash function (BKEX-B3 …”
Volltext

Complexity Analysis of the SAT Attack on Logic Locking von Zhong, Yadi, Guin, Ujjwal

“… Logic locking emerges as a primary design-for-security measure to counter these threats, where ICs become fully functional only when unlocked with a secret key …”
Volltext

A direct product theorem for quantum communication complexity with applications to device-independent QKD von Jain, Rahul, Kundu, Srijita

“… ). For a two-input boolean function, the best result for interactive quantum communication complexity known previously was due to Sherstov (2018 …”
Volltext

Level-Based Analysis of Genetic Algorithms and Other Search Processes von Corus, Dogan, Dang, Duc-Cuong, Eremeev, Anton V., Lehre, Per Kristian

“… Understanding how the time complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation …”
Volltext

A Grover-Meets-Simon Approach to Match Vector Boolean Functions von Venere, Marco, Barenghi, Alessandro, Pelosi, Gerardo

“… The Boolean matching problem via NP-equivalence requires determining whether two Boolean functions are equivalent or not up to a permutation and negation of the input binary variables …”
Volltext

Improved bounds on the AN-complexity of O(1)-linear functions von Goldreich, Oded

“… We consider arithmetic circuits with arbitrary gates for computing Boolean functions that are represented by low-degree polynomials over GF(2 …”
Volltext

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions von Liu, Meicheng, Lin, Dongdai, Pei, Dingyi

“… In this correspondence, first we give a decomposition of symmetric Boolean functions, then we show that almost all symmetric Boolean functions, including these functions with good algebraic immunity …”
Volltext

SMC: Satisfiability Modulo Convex Programming von Shoukry, Yasser, Nuzzo, Pierluigi, Sangiovanni-Vincentelli, Alberto L., Seshia, Sanjit A., Pappas, George J., Tabuada, Paulo

“… Boolean methods such as satisfiability (SAT) solving are successful in tackling large combinatorial search problems for the design and verification of hardware and software components …”
Volltext

Network Classification Based on Reducibility With Respect to the Stability of Canalizing Power of Genes in a Gene Regulatory Network - A Boolean Network Modeling Perspective von Kim, Eunji, Ivanov, Ivan, Dougherty, Edward R.

“… A key objective of studying biological systems is to design therapeutic intervention strategies for beneficially altering cell dynamics …”
Volltext

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions von Ye, Ze-Kun, Li, Lv-Zhou

“… ? This problem has been addressed in the literature for total Boolean functions and symmetric partial Boolean functions, but is still open for general partial Boolean functions …”
Volltext

On the Efficiency of Polar-Like Decoding for Symmetric Codes von Ivanov, Kirill, Urbanke, Rudiger L.

“… grows too fast to make the decoding practical even for moderate block lengths. The key ingredient for proving the capacity-achieving property of Reed-Muller and eBCH codes is their group of symmetries …”
Volltext

Dichotomy for Holant∗ Problems on the Boolean Domain von Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji

“… ) , where F is a set of constraint functions on Boolean variables and taking complex values …”
Volltext

Improving Linear Key Recovery Attacks using Walsh Spectrum Puncturing von Flórez-Gutiérrez, Antonio, Todo, Yosuke

“… In most linear key recovery attacks on block ciphers, the value of the target linear approximation is determined from the plaintext, ciphertext and key by a function …”
Volltext

Approximate Logic Synthesis of Very Large Boolean Networks von Echavarria, Jorge, Wildermann, Stefan, Teich, Jurgen

“… For very large Boolean circuits most approximate logic synthesis techniques successively apply local approximation transformations affecting only a portion of the whole design …”
Volltext

New Techniques for Proving Fine-Grained Average-Case Hardness von Dalirrooyfard, Mina, Lincoln, Andrea, Williams, Virginia Vassilevska

“… The recent emergence of fine-grained cryptography strongly motivates developing an average-case analogue of Fine-Grained Complexity (FGC). Prior work …”
Volltext

Efficient minimization of higher order submodular functions using monotonic Boolean functions von Ramalingam, Srikumar, Russell, Chris, Ladický, L’ubor, Torr, Philip H.S.

“… Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others …”
Volltext

Some Conditional Cube Testers for Grain-128a of Reduced Rounds von Dalai, Deepak Kumar, Pal, Santu, Sarkar, Santanu

“… In this article, a new strategy, maximum last <inline-formula><tex-math notation="LaTeX">\alpha</tex-math> …”
Volltext

Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity von Mesnager, S.

“… The algebraic immunity of a Boolean function quantifies its resistance to the standard algebraic attacks of the pseudorandom generators using it as a nonlinear filtering or combining function …”
Volltext