Suchergebnisse - (( key words. boolean function complexity ) OR ( Key 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

An improved test of Boolean functions for k-dimensionality von Alekseychuk, A. N., Konyushok, S. N.

“… A probabilistic test of Boolean functions for k -dimensionality is constructed. The test has a less time complexity and a smaller first kind error probability …”
Volltext

An Algorithm for Constructing Reduced DNFs of Order-Convex Boolean Functions von Timoshkin, A. I.

“… This paper considers the problem of constructing reduced disjunctive normal forms of order-convex 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

Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions von Karasan, O. Ekin

“… We consider the problem of dualizing a Boolean function f represented by a DNF. In its most general form, this problem is commonly believed not to be solvable by a quasi-polynomial total time algorithm …”
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

Progressive decomposition: a heuristic to structure arithmetic circuits von Verma, Ajay K., Brisk, Philip, Ienne, Paolo

“… In other words, logic synthesis optimisations hardly change the architecture of the given circuit …”
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

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

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

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

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

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

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

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

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

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

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