Results 41 to 50 of about 8,138,818 (342)
Yoyo trick on type‐II generalised Feistel networks
IET Information Security, 2021 This work presents a structural attack against the type‐II generalised Feistel network (GFN) with secret internal functions. First, equivalent structures of the 7‐round type‐II GFN are provided, which helps reduce the first guess of the secret round ...
Tao Hou, Ting Cui
doaj +1 more source
Functional impact of multi-omic interactions in breast cancer subtypes
Frontiers in Genetics, 2023 Multi-omic approaches are expected to deliver a broader molecular view of cancer. However, the promised mechanistic explanations have not quite settled yet. Here, we propose a theoretical and computational analysis framework to semi-automatically produce
Soledad Ochoa +3 more
doaj +1 more source
Meta-Mathematics of Computational Complexity Theory [PDF]
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory.
I. C. Oliveira
semanticscholar +1 more source
ON THE COMPLEXITY OF COMPUTING DETERMINANTS [PDF]
Computer Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Erich L. Kaltofen, Gilles Villard
openaire +1 more source
Computational Power Evaluation for Energy-Constrained Wireless Communications Systems
IEEE Open Journal of the Communications Society, 2020 Estimating the power consumption and computational complexity of various digital signal processing (DSP) algorithms used in wireless communications systems is critical to assess the feasibility of implementing such algorithms in hardware, and for ...
Maryam Tariq +4 more
doaj +1 more source
A Robust Version of Heged\H{u}s's Lemma, with Applications [PDF]
TheoretiCS, 2023 Heged\H{u}s's lemma is the following combinatorial statement regarding polynomials over finite fields. Over a field $\mathbb{F}$ of characteristic $p > 0$ and for $q$ a power of $p$, the lemma says that any multilinear polynomial $P\in \mathbb{F}[x_1 ...
Srikanth Srinivasan
doaj +1 more source
Institutional complexity is complexity with an adjective [PDF]
, 2021 A review of the studies on institutional complexity reveals that the many definitions of institutional complexity and related concepts share similarities with the understanding of complexity and complex systems of complexity science. Yet few publications
Papin, Marielle, Marielle Papin
core +1 more source
Molecular mechanisms of multi-omic regulation in breast cancer
Frontiers in Oncology, 2023 Breast cancer is a complex disease that is influenced by the concurrent influence of multiple genetic and environmental factors. Recent advances in genomics and other high throughput biomolecular techniques (-omics) have provided numerous insights into ...
Soledad Ochoa +3 more
doaj +1 more source
On the Complexity of Computing Treelength [PDF]
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing [PDF]
TheoretiCS, 2022 A graph $G$ is called self-ordered (a.k.a asymmetric) if the identity permutation is its only automorphism. Equivalently, there is a unique isomorphism from $G$ to any graph that is isomorphic to $G$. We say that $G=(V,E)$ is robustly self-ordered if the
Oded Goldreich, Avi Wigderson
doaj +1 more source