Suchergebnisse - (( Key words. boolean function complexity ) OR ( Key works. boolean function complexity ))

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

Critical Properties and Complexity Measures of Read-Once Boolean Functions von Lozin, Vadim, Moshkov, Mikhail

“… In this paper, we define a quasi-order on the set of read-once Boolean functions and show that this is a well-quasi-order …”
Volltext

Improved Bounds for Wireless Localization von Christ, Tobias, Hoffmann, Michael, Okamoto, Yoshio, Uno, Takeaki

“… In other words, the interior of the polygon must be described by a monotone Boolean formula composed from the keys …”
Volltext

Perfect Tabular Hashing in Pseudolinear Time von Palit, Shekhar, Wortman, Kevin A.

“… Given n keys of word size W, we show how to compute a perfect hash function in O(nW) worst-case time. This is competitive with other perfect hashing methods, and the resultant hash functions are simple and performant …”
Volltext

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds von Gutfreund, Dan, Kawachi, Akinori

“… We show that if Arthur-Merlin protocols can be derandomized, then there is a Boolean function computable in deterministic exponential-time with access to an NP oracle, that cannot be computed …”
Volltext

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

VC-dimensions of nondeterministic finite automata for words of equal length von Kjos-Hanssen, Bjørn, Felix, Clyde James, Kim, Sun Young, Lamb, Ethan, Takahashi, Davin

“… ) } as a function of q . Next, the work of Gruber and Holzer (Theoret. Comput. Sci. 387 (2): 155–166, 2007 ) gives an upper bound for the nondeterministic state complexity of finite languages contained in B n , which we strengthen using our methods …”
Volltext

Halfspace Matrices von Sherstov, Alexander A.

“… In communication complexity, we exhibit a Boolean function f with discrepancy Ω(1/ n 4 ) under every product distribution but under a certain non-product distribution …”
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

Reconstructability analysis: theory and applications von Zwick, Martin, Shu, Guangfu, Lin, Yi

“… In previous work, modified reconstructability analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional reconstructability analysis (CRA …”
Volltext

EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores von Li, Yuxi, Chen, Jingjing, Zhou, Fucai, Ji, Dong

“… queries over encrypted key-value data. We have integrated blockchain and homomorphic Xor operations and pseudo-random functions to create a secure and verifiable datastore, while enabling efficient encrypted Boolean queries …”
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

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

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

Algebraic immunity for cryptographically significant Boolean functions: analysis and construction von 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 …”
Volltext

Two function algebras defining functions in NC k boolean circuits von Bonfante, Guillaume, Kahle, Reinhard, Marion, Jean-Yves, Oitavem, Isabel

“… We describe the functions computed by boolean circuits in NCk by means of func- tions algebra for k …”
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

On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy von Baillot, Patrick

“… way the more interesting complexity class of polynomial time functions, but at the price of either …”
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

Alternative approach to calculate the structure matrix of Boolean network with semi-tensor product von 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 …”
Volltext