Results 31 to 40 of about 8,138,818 (342)
Cryptanalysis of a white‐box SM4 implementation based on collision attack
IET Information Security, 2022 White‐box cryptography is to primarily protect the key of a cipher from being extracted in a white‐box scenario, where an adversary has full access to the execution environment of software implementation. Since the introduction of white‐box cryptography,
Rusi Wang +3 more
doaj +1 more source
Artificial life meets computational creativity? [PDF]
, 2009 I review the history of work in Artificial Life on the problem of the open-ended evolutionary growth of complexity in computational worlds.
McMullin, Barry
core +3 more sources
Linear robust adaptive model predictive control: Computational complexity and conservatism [PDF]
IEEE Conference on Decision and Control, 2019 In this paper, we present a robust adaptive model predictive control (MPC) scheme for linear systems subject to parametric uncertainty and additive disturbances.
Johannes Köhler +4 more
semanticscholar +1 more source
Group mixing drives inequality in face-to-face gatherings
Communications Physics, 2022 The emergence of inequality in social interactions can depend on a number of factors, among which the intrinsic attractiveness of individuals, but also group size the presence of pre-formed social ties.
Marcos Oliveira +5 more
doaj +1 more source
The computational complexity of linear optics [PDF]
Theory of Computing, 2010 We give new evidence that quantum computers -- moreover, rudimentary quantum computers built entirely out of linear-optical elements -- cannot be efficiently simulated by classical computers.
S. Aaronson, Alexei Y. Arkhipov
semanticscholar +1 more source
Complexity of computations [PDF]
Communications of the ACM, 1977 The framework for research in the theory of complexity of computations is described, emphasizing the interrelation between seemingly diverse problems and methods. Illustrative examples of practical and theoretical significance are given. Directions for new research are discussed.
openaire +2 more sources
Computational Complexity in Additive Hedonic Games [PDF]
, 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
Frontiers in Public Health, 2023 IntroductionThe COVID-19 pandemic, especially its early stages, sparked extensive discussions regarding the potential impact of metabolic and cardiovascular comorbidities on the severity and fatality of SARS-CoV-2 infection, yielding inconclusive ...
Jonathan Ariel López-Cuevas +7 more
doaj +1 more source
Computational Complexity of the Interleaving Distance [PDF]
International Symposium on Computational Geometry, 2017 The interleaving distance is arguably the most prominent distance measure in topological data analysis. In this paper, we provide bounds on the computational complexity of determining the interleaving distance in several settings.
Håvard Bakke Bjerkevik, M. Botnan
semanticscholar +1 more source
Computational Complexity of Puzzles and Games (Invited Talk) [PDF]
, 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