Výsledky vyhľadávania - Key words. boolean function complexity

  1. 1

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

    ISSN: 1012-2443, 1573-7470
    Vydavateľské údaje: Cham Springer International Publishing 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
  2. 2

    Privacy-Preserving Boolean Range Query With Temporal Access Control in Mobile Computing Autor Tong, Qiuyun, Li, Xinghua, Miao, Yinbin, Liu, Ximeng, Weng, Jian, Deng, Robert H.

    ISSN: 1041-4347, 1558-2191
    Vydavateľské údaje: New York IEEE 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
  3. 3

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

    ISSN: 1424-8220, 1424-8220
    Vydavateľské údaje: Switzerland MDPI AG 22.10.2024
    Vydané 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
  4. 4

    Minimum complexity drives regulatory logic in Boolean models of living systems Autor Subbaroyan, Ajay, Martin, Olivier C, Samal, Areejit

    ISSN: 2752-6542, 2752-6542
    Vydavateľské údaje: England Oxford University Press 01.03.2022
    Vydané 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
  5. 5

    Characterization of Exact One-Query Quantum Algorithms for Partial Boolean Functions Autor Ye, Ze-Kun, Li, Lv-Zhou

    ISSN: 1000-9000, 1860-4749
    Vydavateľské údaje: Singapore Springer Nature Singapore 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
  6. 6

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

    ISSN: 0890-5401, 1090-2651
    Vydavateľské údaje: Elsevier 01.06.2016
    Vydané 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
  7. 7

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

    ISSN: 0890-5401, 1090-2651
    Vydavateľské údaje: Elsevier Inc 01.04.2015
    Vydané 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
  8. 8

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

    ISSN: 0890-5401, 1090-2651
    Vydavateľské údaje: Elsevier Inc 01.06.2016
    Vydané v Information and computation (01.06.2016)
    “…We describe the functions computed by boolean circuits in NCk by means of functions algebra for k…”
    Získať plný text
    Journal Article
  9. 9

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

    ISSN: 2076-3417, 2076-3417
    Vydavateľské údaje: Basel MDPI AG 15.10.2020
    Vydané v Applied sciences (15.10.2020)
    “… In this paper, for a single Boolean function, a direct conversion between the minterm canonical form and the structure matrix is provided…”
    Získať plný text
    Journal Article
  10. 10

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

    ISSN: 1060-0396, 1573-8337
    Vydavateľské údaje: Boston Springer US 01.03.2013
    Vydané 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
  11. 11
  12. 12

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

    ISSN: 1462-2416, 1744-8042
    Vydavateľské údaje: England Ashley Publications Ltd 01.08.2001
    Vydané v Pharmacogenomics (01.08.2001)
    “… 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…”
    Získať plný text
    Journal Article
  13. 13

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

    ISSN: 1060-0396, 1573-8337
    Vydavateľské údaje: New York Springer US 01.01.2019
    Vydané 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
  14. 14

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

    ISSN: 1471-2164, 1471-2164
    Vydavateľské údaje: London BioMed Central 25.04.2020
    Vydané v BMC genomics (25.04.2020)
    “…Background Post-database search is a key procedure in peptide identification with tandem mass spectrometry (MS/MS…”
    Získať plný text
    Journal Article
  15. 15

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

    ISSN: 0964-7058, 1440-6047, 1440-6047
    Vydavateľské údaje: Clayton, Vic HEC Press 01.03.2023
    “… Methods and Study Design: Literature searching was conducted in Pubmed, ProQuest and Google Scholar using the keywords "diet quality", "intestinal permeability…”
    Získať plný text
    Journal Article
  16. 16

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

    ISSN: 1091-6490, 1091-6490
    Vydavateľské údaje: United States 10.06.2025
    “…Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science…”
    Zistit podrobnosti o prístupe
    Journal Article
  17. 17

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

    ISSN: 1365-8050, 1462-7264, 1365-8050
    Vydavateľské údaje: Nancy DMTCS 01.12.2011
    “…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…”
    Získať plný text
    Journal Article
  18. 18

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

    ISSN: 0254-5330, 1572-9338
    Vydavateľské údaje: Boston Springer US 01.08.2011
    Vydané 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
  19. 19

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

    ISSN: 0178-4617, 1432-0541
    Vydavateľské údaje: New York Springer-Verlag 01.07.2010
    Vydané 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..
  20. 20

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

    ISSN: 2398-8835, 2398-8835
    Vydavateľské údaje: United States John Wiley & Sons, Inc 01.11.2025
    Vydané v Health science reports (01.11.2025)
    “… combinations of keywords (e.g., “Tongue Transplant,” “Tongue Reconstructive Surgery”). Studies were screened and selected according to PRISMA guidelines…”
    Získať plný text
    Journal Article