Search Results - Key words. boolean function complexity*

Critical Properties and Complexity Measures of Read-Once Boolean Functions by 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…”
Get full text

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

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

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

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

Two function algebras defining functions in NC k boolean circuits by 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…”
Get full text

Circuit complexity and functionality: A statistical thermodynamics perspective by Chamon, Claudio, Ruckenstein, Andrei E, Mucciolo, Eduardo R, Canetti, Ran

“…Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science…”
Get more information

Conversion between Logic and Algebraic Expressions of Boolean Control Networks by Wang, Cailu, Tao, Yuegang

“… In this paper, for a single Boolean function, a direct conversion between the minterm canonical form and the structure matrix is provided…”
Get full text

Genomics, complexity and drug discovery: insights from Boolean network models of cellular regulation by Huang, Sui

“… It is now becoming clear that to elucidate the fundamental principles that govern how genomic information translates into organismal complexity, we must overcome the current habit of ad hoc…”
Get full text

A cost-sensitive online learning method for peptide identification by Liang, Xijun, Xia, Zhonghang, Jian, Ling, Wang, Yongxiang, Niu, Xinnan, Link, Andrew J.

“…Background Post-database search is a key procedure in peptide identification with tandem mass spectrometry (MS/MS…”
Get full text

An improved test of Boolean functions for k-dimensionality by 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…”
Get full text

EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores by 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…”
Get full text

VC-dimensions of nondeterministic finite automata for words of equal length by 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…”
Get full text

Improved Bounds for Wireless Localization by 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…”
Get full text

Two function algebras defining functions in NCk boolean circuits by Bonfante, Guillaume, Kahle, Reinhard, Marion, Jean-Yves, Oitavem, Isabel

“…We describe the functions computed by boolean circuits in NCk by means of functions algebra for k…”
Get full text

Towards efficient Secure Boolean Range Query over encrypted spatial data by Zhao, Xuan, Yu, Jia, Ge, Xinrui, Hao, Rong

Get full text

Perfect Tabular Hashing in Pseudolinear Time by 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…”
Get full text

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds by 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…”
Get full text

Spatio-Cultural Evolution as Information Dynamics: Part I by Posner, Zeev

“…A view of evolution is presented in this paper (a two paper series), intended as a methodological infrastructure for modeling spatio-cultural systems (the…”
Get full text

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

“…This paper considers the problem of constructing reduced disjunctive normal forms of order-convex Boolean functions…”
Get full text