Results 21 to 30 of about 449,948 (311)

Yoyo trick on type‐II generalised Feistel networks

open access: yesIET 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

open access: yesFrontiers 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

Computational Complexity of Puzzles and Games (Invited Talk) [PDF]

open access: yes, 2015
A computation consists of algorithm of basic operations. When you consider an algorithm, you assume, say, the standard RAM model, that has “usual” arithmetic operations.
Uehara, Ryuhei
core   +1 more source

A Robust Version of Heged\H{u}s's Lemma, with Applications [PDF]

open access: yesTheoretiCS, 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

Computational Complexity in Additive Hedonic Games [PDF]

open access: yes, 2008
We investigate the computational complexity of several decision problems in hedonic coalition formation games and demonstrate that attaining stability in such games remains NP-hard even when they are additive.
Shao-Chin Sung   +3 more
core   +1 more source

Computational Power Evaluation for Energy-Constrained Wireless Communications Systems

open access: yesIEEE 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

Molecular mechanisms of multi-omic regulation in breast cancer

open access: yesFrontiers 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

Robustly Self-Ordered Graphs: Constructions and Applications to Property Testing [PDF]

open access: yesTheoretiCS, 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

On the Complexity of Computing Treelength [PDF]

open access: yesDiscrete Applied Mathematics, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Information complexity is computable

open access: yesCoRR, 2015
The information complexity of a function $f$ is the minimum amount of information Alice and Bob need to exchange to compute the function $f$. In this paper we provide an algorithm for approximating the information complexity of an arbitrary function $f$ to within any additive error $α> 0$, thus resolving an open question as to whether information ...
Braverman, Mark, Schneider, Jon
openaire   +5 more sources

Home - About - Disclaimer - Privacy