Výsledky vyhledávání - key ((works. OR yorks.) OR york.) boolean function complexity*

  1. 1

    Boolean semiring key-exchange with BLAKE3 security (BKEX-B3) Autor Alvary Kefas Kwala, Alpna Mishra, Shri Kant

    ISSN: 2948-2992
    Vydáno: Springer 27.07.2025
    Vydáno v Discover Computing (27.07.2025)
    “… This work presents a new Boolean Semiring Key Exchange Protocol combined with BLAKE3 cryptographic hash function (BKEX-B3…”
    Získat 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
    Vydáno: 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ískat plný text
    Journal Article
  3. 3

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

    ISSN: 2752-6542, 2752-6542
    Vydáno: England Oxford University Press 01.03.2022
    Vydáno 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ískat plný text
    Journal Article
  4. 4

    A direct product theorem for quantum communication complexity with applications to device-independent QKD Autor Jain, Rahul, Kundu, Srijita

    ISSN: 2575-8454
    Vydáno: IEEE 01.02.2022
    “…). For a two-input boolean function, the best result for interactive quantum communication complexity known previously was due to Sherstov (2018…”
    Získat plný text
    Konferenční příspěvek
  5. 5

    Complexity Analysis of the SAT Attack on Logic Locking Autor Zhong, Yadi, Guin, Ujjwal

    ISSN: 0278-0070, 1937-4151
    Vydáno: New York IEEE 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ískat plný text
    Journal Article
  6. 6

    Improved bounds on the AN-complexity of O(1)-linear functions Autor Goldreich, Oded

    ISSN: 1016-3328, 1420-8954
    Vydáno: Cham Springer International Publishing 01.12.2022
    Vydáno v Computational complexity (01.12.2022)
    “…We consider arithmetic circuits with arbitrary gates for computing Boolean functions that are represented by low-degree polynomials over GF(2…”
    Získat plný text
    Journal Article
  7. 7

    Level-Based Analysis of Genetic Algorithms and Other Search Processes Autor Corus, Dogan, Dang, Duc-Cuong, Eremeev, Anton V., Lehre, Per Kristian

    ISSN: 1089-778X, 1941-0026
    Vydáno: New York IEEE 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ískat plný text
    Journal Article
  8. 8

    A Grover-Meets-Simon Approach to Match Vector Boolean Functions Autor Venere, Marco, Barenghi, Alessandro, Pelosi, Gerardo

    ISSN: 2689-1808, 2689-1808
    Vydáno: New York IEEE 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ískat plný text
    Journal Article
  9. 9

    Fast Algebraic Attacks and Decomposition of Symmetric Boolean Functions Autor Liu, Meicheng, Lin, Dongdai, Pei, Dingyi

    ISSN: 0018-9448, 1557-9654
    Vydáno: New York, NY IEEE 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ískat plný text
    Journal Article
  10. 10

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

    ISSN: 1000-9000, 1860-4749
    Vydáno: 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ískat plný text
    Journal Article
  11. 11

    SMC: Satisfiability Modulo Convex Programming Autor Shoukry, Yasser, Nuzzo, Pierluigi, Sangiovanni-Vincentelli, Alberto L., Seshia, Sanjit A., Pappas, George J., Tabuada, Paulo

    ISSN: 0018-9219, 1558-2256
    Vydáno: New York IEEE 01.09.2018
    Vydáno v Proceedings of the IEEE (01.09.2018)
    “… Boolean methods such as satisfiability (SAT) solving are successful in tackling large combinatorial search problems for the design and verification of hardware and software components…”
    Získat plný text
    Journal Article
  12. 12

    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 Autor Kim, Eunji, Ivanov, Ivan, Dougherty, Edward R.

    ISSN: 1545-5963, 1557-9964, 1557-9964
    Vydáno: United States IEEE 01.01.2022
    “…A key objective of studying biological systems is to design therapeutic intervention strategies for beneficially altering cell dynamics…”
    Získat plný text
    Journal Article
  13. 13

    On the Efficiency of Polar-Like Decoding for Symmetric Codes Autor Ivanov, Kirill, Urbanke, Rudiger L.

    ISSN: 0090-6778, 1558-0857
    Vydáno: New York IEEE 01.01.2022
    Vydáno v IEEE transactions on communications (01.01.2022)
    “… grows too fast to make the decoding practical even for moderate block lengths. The key ingredient for proving the capacity-achieving property of Reed-Muller and eBCH codes is their group of symmetries…”
    Získat plný text
    Journal Article
  14. 14

    Dichotomy for Holant∗ Problems on the Boolean Domain Autor Cai, Jin-Yi, Lu, Pinyan, Xia, Mingji

    ISSN: 1432-4350, 1433-0490
    Vydáno: New York Springer US 01.11.2020
    Vydáno v Theory of computing systems (01.11.2020)
    “… ) , where F is a set of constraint functions on Boolean variables and taking complex values…”
    Získat plný text
    Journal Article
  15. 15

    Efficient minimization of higher order submodular functions using monotonic Boolean functions Autor Ramalingam, Srikumar, Russell, Chris, Ladický, L’ubor, Torr, Philip H.S.

    ISSN: 0166-218X, 1872-6771
    Vydáno: Amsterdam Elsevier B.V 31.03.2017
    Vydáno v Discrete Applied Mathematics (31.03.2017)
    “…Submodular function minimization is a key problem in a wide variety of applications in machine learning, economics, game theory, computer vision, and many others…”
    Získat plný text
    Journal Article
  16. 16

    Improving Linear Key Recovery Attacks using Walsh Spectrum Puncturing Autor Flórez-Gutiérrez, Antonio, Todo, Yosuke

    ISSN: 0933-2790, 1432-1378
    Vydáno: New York Springer Nature B.V 01.10.2025
    Vydáno v Journal of cryptology (01.10.2025)
    “…In most linear key recovery attacks on block ciphers, the value of the target linear approximation is determined from the plaintext, ciphertext and key by a function…”
    Získat plný text
    Journal Article
  17. 17

    Approximate Logic Synthesis of Very Large Boolean Networks Autor Echavarria, Jorge, Wildermann, Stefan, Teich, Jurgen

    ISSN: 1558-1101
    Vydáno: EDAA 01.02.2021
    “…For very large Boolean circuits most approximate logic synthesis techniques successively apply local approximation transformations affecting only a portion of the whole design…”
    Získat plný text
    Konferenční příspěvek
  18. 18

    Alternative approach to calculate the structure matrix of Boolean network with semi-tensor product Autor Zhang, Xiao Hua, Han, Hua Xiang, Sun, Zhi Jian, Zhang, Wei Dong

    ISSN: 1751-8644, 1751-8652
    Vydáno: The Institution of Engineering and Technology 01.09.2017
    Vydáno v IET control theory & applications (01.09.2017)
    “… The key of the proposed new method is applying the superposition and expansion techniques to the initial matrix and the target matrix, which dramatically reduces computational complexity…”
    Získat plný text
    Journal Article
  19. 19

    New Techniques for Proving Fine-Grained Average-Case Hardness Autor Dalirrooyfard, Mina, Lincoln, Andrea, Williams, Virginia Vassilevska

    ISSN: 2575-8454
    Vydáno: IEEE 01.11.2020
    “…The recent emergence of fine-grained cryptography strongly motivates developing an average-case analogue of Fine-Grained Complexity (FGC). Prior work…”
    Získat plný text
    Konferenční příspěvek
  20. 20

    Complex adaptive systems: an introduction to computational models of social life. Autor Miller, John H, Miller, John H, Page, Scott E

    ISBN: 9780691127026, 0691130965, 9780691130965, 0691127026, 9781400835522, 1400835526
    Vydáno: Princeton, N.J Princeton University Press 2007
    “… Engagingly written, and balancing technical detail with intuitive explanations,Complex Adaptive Systemsfocuses on the key tools and ideas that have emerged in the field since the mid-1990s, as well…”
    Získat plný text
    E-kniha Kniha