Výsledky vyhľadávania - (( key words. boolean function complexity ) OR ( Key york. boolean function complexity ))
-
1
Privacy-Preserving Boolean Range Query With Temporal Access Control in Mobile Computing
ISSN: 1041-4347, 1558-2191Vydavateľské údaje: New York IEEE 01.05.2023Vydané v IEEE transactions on knowledge and data engineering (01.05.2023)“…), massive spatio-textual data has been outsourced to cloud servers for storage and analysis such as spatial keyword search…”
Získať plný text
Journal Article -
2
Minimum complexity drives regulatory logic in Boolean models of living systems
ISSN: 2752-6542, 2752-6542Vydavateľské údaje: England Oxford University Press 01.03.2022Vydané v PNAS nexus (01.03.2022)“… However, the Boolean functions (BFs) specifying the associated logical update rules should not be expected to be random…”
Získať plný text
Journal Article -
3
An improved test of Boolean functions for k-dimensionality
ISSN: 1060-0396, 1573-8337Vydavateľské údaje: Boston Springer US 01.03.2013Vydané v Cybernetics and systems analysis (01.03.2013)“…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…”
Získať plný text
Journal Article -
4
An Algorithm for Constructing Reduced DNFs of Order-Convex Boolean Functions
ISSN: 1060-0396, 1573-8337Vydavateľské údaje: New York Springer US 01.01.2019Vydané v Cybernetics and systems analysis (01.01.2019)“…This paper considers the problem of constructing reduced disjunctive normal forms of order-convex Boolean functions…”
Získať plný text
Journal Article -
5
Critical Properties and Complexity Measures of Read-Once Boolean Functions
ISSN: 1012-2443, 1573-7470Vydavateľské údaje: Cham Springer International Publishing 01.06.2021Vydané v Annals of mathematics and artificial intelligence (01.06.2021)“…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…”
Získať plný text
Journal Article -
6
Incremental polynomial time dualization of quadratic functions and a subclass of degree-k functions
ISSN: 0254-5330, 1572-9338Vydavateľské údaje: Boston Springer US 01.08.2011Vydané v Annals of operations research (01.08.2011)“…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…”
Získať plný text
Journal Article -
7
Improved Bounds for Wireless Localization
ISSN: 0178-4617, 1432-0541Vydavateľské údaje: New York Springer-Verlag 01.07.2010Vydané v Algorithmica (01.07.2010)“… In other words, the interior of the polygon must be described by a monotone Boolean formula composed from the keys…”
Získať plný text
Journal Article Konferenčný príspevok.. -
8
Perfect Tabular Hashing in Pseudolinear Time
Vydavateľské údaje: IEEE 27.01.2021Vydané v 2021 IEEE 11th Annual Computing and Communication Workshop and Conference (CCWC) (27.01.2021)“… 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…”
Získať plný text
Konferenčný príspevok.. -
9
Progressive decomposition: a heuristic to structure arithmetic circuits
ISBN: 1595936270, 9781595936271ISSN: 0738-100XVydavateľské údaje: New York, NY, USA ACM 04.06.2007Vydané v 2007 44th ACM/IEEE Design Automation Conference (04.06.2007)“… In other words, logic synthesis optimisations hardly change the architecture of the given circuit…”
Získať plný text
Konferenčný príspevok.. -
10
EKV-VBQ: Ensuring Verifiable Boolean Queries in Encrypted Key-Value Stores
ISSN: 1424-8220, 1424-8220Vydavateľské údaje: Switzerland MDPI AG 22.10.2024Vydané v Sensors (Basel, Switzerland) (22.10.2024)“… 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…”
Získať plný text
Journal Article -
11
Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York, NY IEEE 01.07.2011Vydané v IEEE transactions on information theory (01.07.2011)“…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…”
Získať plný text
Journal Article -
12
Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions
ISSN: 1000-9000, 1860-4749Vydavateľské údaje: Singapore Springer Nature Singapore 01.12.2023Vydané v Journal of computer science and technology (01.12.2023)“…? 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…”
Získať plný text
Journal Article -
13
Two function algebras defining functions in NC k boolean circuits
ISSN: 0890-5401, 1090-2651Vydavateľské údaje: Elsevier 01.06.2016Vydané v Information and computation (01.06.2016)“…We describe the functions computed by boolean circuits in NCk by means of func- tions algebra for k…”
Získať plný text
Journal Article -
14
A Grover-Meets-Simon Approach to Match Vector Boolean Functions
ISSN: 2689-1808, 2689-1808Vydavateľské údaje: New York IEEE 2025Vydané v IEEE transactions on quantum engineering (2025)“…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…”
Získať plný text
Journal Article -
15
Algebraic immunity for cryptographically significant Boolean functions: analysis and construction
ISSN: 0018-9448, 1557-9654Vydavateľské údaje: New York, NY IEEE 01.07.2006Vydané v IEEE transactions on information theory (01.07.2006)“… 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…”
Získať plný text
Journal Article -
16
On the expressivity of elementary linear logic: Characterizing Ptime and an exponential time hierarchy
ISSN: 0890-5401, 1090-2651Vydavateľské údaje: Elsevier Inc 01.04.2015Vydané v Information and computation (01.04.2015)“… way the more interesting complexity class of polynomial time functions, but at the price of either…”
Získať plný text
Journal Article -
17
Level-Based Analysis of Genetic Algorithms and Other Search Processes
ISSN: 1089-778X, 1941-0026Vydavateľské údaje: New York IEEE 01.10.2018Vydané v IEEE transactions on evolutionary computation (01.10.2018)“…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…”
Získať plný text
Journal Article -
18
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
ISSN: 1545-5963, 1557-9964, 1557-9964Vydavateľské údaje: United States IEEE 01.01.2022Vydané v IEEE/ACM transactions on computational biology and bioinformatics (01.01.2022)“…A key objective of studying biological systems is to design therapeutic intervention strategies for beneficially altering cell dynamics…”
Získať plný text
Journal Article -
19
Dichotomy for Holant∗ Problems on the Boolean Domain
ISSN: 1432-4350, 1433-0490Vydavateľské údaje: New York Springer US 01.11.2020Vydané v Theory of computing systems (01.11.2020)“… ) , where F is a set of constraint functions on Boolean variables and taking complex values…”
Získať plný text
Journal Article -
20
Complexity Analysis of the SAT Attack on Logic Locking
ISSN: 0278-0070, 1937-4151Vydavateľské údaje: New York IEEE 01.10.2023Vydané v IEEE transactions on computer-aided design of integrated circuits and systems (01.10.2023)“… 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…”
Získať plný text
Journal Article

