Suchergebnisse - Key words. boolean function complexity

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

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

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

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

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

Two function algebras defining functions in NCk 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 functions algebra for k …”
Volltext

Conversion between Logic and Algebraic Expressions of Boolean Control Networks von 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 …”
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

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

Volltext

Genomics, complexity and drug discovery: insights from Boolean network models of cellular regulation von 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 …”
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

A cost-sensitive online learning method for peptide identification von 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 …”
Volltext

Diet, nutrition and intestinal permeability: A mini review von Ekawidyani, Karina Rahmadia, Abdullah, Murdani

“… Methods and Study Design: Literature searching was conducted in Pubmed, ProQuest and Google Scholar using the keywords "diet quality", "intestinal permeability …”
Volltext

Circuit complexity and functionality: A statistical thermodynamics perspective von 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 …”
Weitere Angaben

On the sensitivity of cyclically-invariant Boolean functions von Chakraborty, Sourav

“… special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity In this paper we construct a cyclically invariant Boolean function whose sensitivity is Theta(n(1/3 …”
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

Advancements and Challenges in Tongue Transplantation: A Comprehensive Review and Meta‐Analysis (A Systematic Review) von Manea, Hashim, Alhatemi, Ahmed Qasim Mohammed, Sulaiman, Fatimah Abdullah, Hashim, Ali Talib, Al‐Ghuraibawi, Mohammedbaqer Ali

“… combinations of keywords (e.g., “Tongue Transplant,” “Tongue Reconstructive Surgery”). Studies were screened and selected according to PRISMA guidelines …”
Volltext