Výsledky vyhľadávania - Key works. 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
    Vydavateľské údaje: Springer 27.07.2025
    Vydané 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ískať plný text
    Journal Article
  2. 2

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

    ISSN: 2689-1808, 2689-1808
    Vydavateľské údaje: 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ískať plný text
    Journal Article
  3. 3

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

    ISSN: 2575-8454
    Vydavateľské údaje: 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ískať plný text
    Konferenčný príspevok..
  4. 4

    Algebraic immunity for cryptographically significant Boolean functions: analysis and construction Autor Carlet, C., Dalai, D.K., Gupta, K.C., Maitra, S.

    ISSN: 0018-9448, 1557-9654
    Vydavateľské údaje: New York, NY IEEE 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
  5. 5

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

    ISSN: 1016-3328, 1420-8954
    Vydavateľské údaje: Cham Springer International Publishing 01.12.2022
    Vydané 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ískať plný text
    Journal Article
  6. 6

    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
  7. 7

    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
    Vydavateľské údaje: Amsterdam Elsevier B.V 31.03.2017
    Vydané 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ískať plný text
    Journal Article
  8. 8

    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
    Vydavateľské údaje: The Institution of Engineering and Technology 01.09.2017
    Vydané 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ískať plný text
    Journal Article
  9. 9

    Conditional Dichotomy of Boolean Ordered Promise CSPs Autor Brakensiek, Joshua, Guruswami, Venkatesan, Sandeep, Sai

    ISSN: 2751-4838, 2751-4838
    Vydavateľské údaje: TheoretiCS Foundation e.V 25.01.2023
    Vydané v TheoretiCS (25.01.2023)
    “…\aa stad, there has been a flurry of works on PCSPs [BBKO19,KO19,WZ20]. The key tool in studying PCSPs is the algebraic framework developed in the context of CSPs…”
    Získať plný text
    Journal Article
  10. 10

    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
    Vydavateľské údaje: New York IEEE 01.09.2018
    Vydané 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ískať plný text
    Journal Article
  11. 11

    An Extended Analysis of the Correlation Extraction Algorithm in the Context of Linear Cryptanalysis Autor Graebnitz, Christoph, Pickel, Valentin, Eble, Holger, Morgner, Frank, Hattenbach, Hannes, Margraf, Marian

    ISSN: 2624-960X, 2624-960X
    Vydavateľské údaje: Basel MDPI AG 01.12.2024
    Vydané v Quantum reports (01.12.2024)
    “… Since these linear cryptanalytic techniques require exploitable linear approximations to relate the input and output of vectorial Boolean functions, e.g…”
    Získať plný text
    Journal Article
  12. 12

    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
    Vydavateľské údaje: 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ískať plný text
    E-kniha Kniha
  13. 13

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

    ISSN: 2575-8454
    Vydavateľské údaje: 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ískať plný text
    Konferenčný príspevok..
  14. 14

    A Boolean Network Approach to Estrogen Transcriptional Regulation Autor Hernández-Lemus, Enrique, Sandoval-Motta, Santiago, Espinal-Enríquez, Jesús, Anda-Jáuregui, Guillermo de

    ISSN: 1076-2787, 1099-0526
    Vydavateľské údaje: Cairo, Egypt Hindawi Publishing Corporation 01.01.2019
    Vydané v Complexity (New York, N.Y.) (01.01.2019)
    “… Estrogen is a sex hormone known for its roles in cell proliferation. Its expression has been involved in several physiological functions such as regulating the menstrual and reproduction cycles in women…”
    Získať plný text
    Journal Article
  15. 15

    A simpler counterexample to a long-standing conjecture on the complexity of Bryantʼs apply algorithm Autor Bollig, Beate

    ISSN: 0020-0190, 1872-6119
    Vydavateľské údaje: Amsterdam Elsevier B.V 01.03.2014
    Vydané v Information processing letters (01.03.2014)
    “… functions by a Boolean operator, and equivalence checking. Based on his empirical evaluation he has conjectured that his apply algorithm for the synthesis works in linear time with respect to the input and output size…”
    Získať plný text
    Journal Article
  16. 16

    A Boolean network model of the double-strand break repair pathway choice Autor Ayala-Zambrano, Cecilia, Yuste, Mariana, Frias, Sara, Garcia-de-Teresa, Benilde, Mendoza, Luis, Azpeitia, Eugenio, Rodríguez, Alfredo, Torres, Leda

    ISSN: 0022-5193, 1095-8541, 1095-8541
    Vydavateľské údaje: Elsevier Ltd 21.09.2023
    Vydané v Journal of theoretical biology (21.09.2023)
    “…•The Boolean network model (BNM) recapitulates HR pathway activity observed in response to DSBs…”
    Získať plný text
    Journal Article
  17. 17

    On the measurement complexity of differentially private query answering Autor Wang, LiWei, Zhang, JiaPeng

    ISSN: 1674-733X, 1869-1919
    Vydavateľské údaje: Beijing Science China Press 01.09.2015
    Vydané v Science China. Information sciences (01.09.2015)
    “…Differentially private query answering is an important problem in machine learning and data anal- ysis. As an example, the users may want to know the empirical…”
    Získať plný text
    Journal Article
  18. 18

    Variable elimination strategies and construction of nonlinear polynomial invariant attacks on T-310 Autor Courtois, Nicolas T., Georgiou, Marios

    ISSN: 0161-1194, 1558-1586
    Vydavateľské údaje: West Point Taylor & Francis 02.01.2020
    Vydané v Cryptologia (02.01.2020)
    “… We work by progressive elimination of specific variables in polynomial spaces and we show that one can totally eliminate big chunks of the cipher circuit…”
    Získať plný text
    Journal Article
  19. 19

    Conditional Dichotomy of Boolean Ordered Promise CSPs Autor Brakensiek, Joshua, Venkatesan Guruswami, Sai Sandeep

    ISSN: 2331-8422
    Vydavateľské údaje: Ithaca Cornell University Library, arXiv.org 23.01.2023
    Vydané v arXiv.org (23.01.2023)
    “…\aa stad, there has been a flurry of works on PCSPs [BBKO19,KO19,WZ20]. The key tool in studying PCSPs is the algebraic framework developed in the context of CSPs…”
    Získať plný text
    Paper
  20. 20

    Characterizing the Impact of Communication on Cellular and Collective Behavior Using a Three-Dimensional Multiscale Cellular Model Autor Echlin, Moriah, Aguilar, Boris, Shmulevich, Ilya

    ISSN: 1099-4300, 1099-4300
    Vydavateľské údaje: Switzerland MDPI AG 01.02.2023
    Vydané v Entropy (Basel, Switzerland) (01.02.2023)
    “…Communication between cells enables the coordination that drives structural and functional complexity in biological systems…”
    Získať plný text
    Journal Article