Search Results - key ((works. OR yorks.) OR york.) boolean function complexity

Boolean semiring key-exchange with BLAKE3 security (BKEX-B3) by 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…”
Get full text

Privacy-Preserving Boolean Range Query With Temporal Access Control in Mobile Computing by 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…”
Get full text

Algebraic immunity for cryptographically significant Boolean functions: analysis and construction by Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.

“… It has been observed that a Boolean function f used as a cryptographic primitive, and interpreted as a multivariate polynomial over F/sub 2/, should not have low degree multiples obtained…”
Get full text

A Grover-Meets-Simon Approach to Match Vector Boolean Functions by 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…”
Get full text

Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions by 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…”
Get full text

Minimum complexity drives regulatory logic in Boolean models of living systems by 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…”
Get full text

A direct product theorem for quantum communication complexity with applications to device-independent QKD by 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…”
Get full text

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

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

Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions by 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…”
Get full text

Level-Based Analysis of Genetic Algorithms and Other Search Processes by 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…”
Get full text

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 by 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…”
Get full text

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

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

Efficient minimization of higher order submodular functions using monotonic Boolean functions by 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…”
Get full text

Complexity Analysis of the SAT Attack on Logic Locking by 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…”
Get full text

Alternative approach to calculate the structure matrix of Boolean network with semi-tensor product by Zhang, Xiao Hua, Han, Hua Xiang, Sun, Zhi Jian, Zhang, Wei Dong

“… The key of the proposed new method is applying the superposition and expansion techniques to the initial matrix and the target matrix, which dramatically reduces computational complexity…”
Get full text

Approximate Logic Synthesis of Very Large Boolean Networks by 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…”
Get full text

Improving the Lower Bound on the Higher Order Nonlinearity of Boolean Functions With Prescribed Algebraic Immunity by 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…”
Get full text

On the Efficiency of Polar-Like Decoding for Symmetric Codes by 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…”
Get full text

SMC: Satisfiability Modulo Convex Programming by 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…”
Get full text

Conditional Dichotomy of Boolean Ordered Promise CSPs by Brakensiek, Joshua, Guruswami, Venkatesan, Sandeep, Sai

“…\aa stad, there has been a flurry of works on PCSPs [BBKO19,KO19,WZ20]. The key tool in studying PCSPs is the algebraic framework developed in the context of CSPs…”
Get full text