Search Results - key works. boolean function complexity*

Refine Results
  1. 1

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

    ISSN: 2948-2992
    Published: Springer 27.07.2025
    Published in Discover Computing (27.07.2025)
    “… This work presents a new Boolean Semiring Key Exchange Protocol combined with BLAKE3 cryptographic hash function (BKEX-B3…”
    Get full text
    Journal Article
  2. 2

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

    ISSN: 2575-8454
    Published: 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…”
    Get full text
    Conference Proceeding
  3. 3

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

    ISSN: 1016-3328, 1420-8954
    Published: Cham Springer International Publishing 01.12.2022
    Published in 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…”
    Get full text
    Journal Article
  4. 4

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

    ISSN: 2689-1808, 2689-1808
    Published: 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…”
    Get full text
    Journal Article
  5. 5

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

    ISSN: 1000-9000, 1860-4749
    Published: Singapore Springer Nature Singapore 01.12.2023
    Published in 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…”
    Get full text
    Journal Article
  6. 6

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

    ISSN: 0018-9219, 1558-2256
    Published: New York IEEE 01.09.2018
    Published in 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…”
    Get full text
    Journal Article
  7. 7

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

    ISSN: 0166-218X, 1872-6771
    Published: Amsterdam Elsevier B.V 31.03.2017
    Published in 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…”
    Get full text
    Journal Article
  8. 8

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

    ISSN: 1751-8644, 1751-8652
    Published: The Institution of Engineering and Technology 01.09.2017
    Published in 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…”
    Get full text
    Journal Article
  9. 9

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

    ISBN: 9780691127026, 0691130965, 9780691130965, 0691127026, 9781400835522, 1400835526
    Published: 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…”
    Get full text
    eBook Book
  10. 10

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

    ISSN: 2624-960X, 2624-960X
    Published: Basel MDPI AG 01.12.2024
    Published in 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…”
    Get full text
    Journal Article
  11. 11

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

    ISSN: 2751-4838, 2751-4838
    Published: TheoretiCS Foundation e.V 25.01.2023
    Published in 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…”
    Get full text
    Journal Article
  12. 12

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

    ISSN: 2575-8454
    Published: 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…”
    Get full text
    Conference Proceeding
  13. 13

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

    ISSN: 0020-0190, 1872-6119
    Published: Amsterdam Elsevier B.V 01.03.2014
    Published in 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…”
    Get full text
    Journal Article
  14. 14

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

    ISSN: 1674-733X, 1869-1919
    Published: Beijing Science China Press 01.09.2015
    Published in 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…”
    Get full text
    Journal Article
  15. 15

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

    ISSN: 1099-4300, 1099-4300
    Published: Switzerland MDPI AG 01.02.2023
    Published in Entropy (Basel, Switzerland) (01.02.2023)
    “…Communication between cells enables the coordination that drives structural and functional complexity in biological systems…”
    Get full text
    Journal Article
  16. 16

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

    ISSN: 0161-1194, 1558-1586
    Published: West Point Taylor & Francis 02.01.2020
    Published in 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…”
    Get full text
    Journal Article
  17. 17

    Toward a theory of one -way functions via gate complexity of Boolean functions by Interlando, J Carmelo

    ISBN: 9780542377037, 0542377039
    Published: ProQuest Dissertations & Theses 01.01.2006
    “… (or circuit) complexity of Boolean functions. The computational security of public-key cryptographic systems depends fundamentally on trapdoor one-way functions…”
    Get full text
    Dissertation
  18. 18

    Linearization of nonlinear filter generators and its application to cryptanalysis of stream ciphers by Zhong, Jianghua, Lin, Dongdai

    ISSN: 0885-064X, 1090-2708
    Published: Elsevier Inc 01.08.2016
    Published in Journal of Complexity (01.08.2016)
    “…) to improve the linear complexity of keystream sequences. However, the LFSR-based stream ciphers are still potentially vulnerable to algebraic attacks that recover the key from some keystream bits…”
    Get full text
    Journal Article
  19. 19

    On the sample complexity of linear code equivalence for all code rates by Budroni, Alessandro, Natale, Andrea

    ISSN: 1936-2447, 1936-2455
    Published: New York Springer US 01.07.2025
    Published in Cryptography and communications (01.07.2025)
    “… In this work, we generalize the proposed attacks to cover all code rates. We show that the complexity…”
    Get full text
    Journal Article
  20. 20

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

    ISSN: 2331-8422
    Published: Ithaca Cornell University Library, arXiv.org 23.01.2023
    Published in 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…”
    Get full text
    Paper