Results 61 to 70 of about 1,491,574 (265)
The Complexity of Mental Integer Addition
Journal of Numerical Cognition, 2020 An important paradigm in modeling the complexity of mathematical tasks relies on computational complexity theory, in which complexity is measured through the resources (time, space) taken by a Turing machine to carry out the task.
Stefan Buijsman, Markus Pantsar
doaj +1 more source
Cytoplasmic p21 promotes stemness of colon cancer cells via activation of the NFκB pathway
Molecular Oncology, EarlyView.Cytoplasmic p21 promotes colorectal cancer stem cell (CSC) features by destabilizing the NFκB–IκB complex, activating NFκB signaling, and upregulating BCL‐xL and COX2. In contrast to nuclear p21, cytoplasmic p21 enhances spheroid formation and stemness transcription factor CD133.
Arnatchai Maiuthed +10 more
wiley +1 more source
Entropy, 2020 Sources that generate symbolic sequences with algorithmic nature may differ in statistical complexity because they create structures that follow algorithmic schemes, rather than generating symbols from a probabilistic function assuming independence.
Jorge M. Silva +3 more
doaj +1 more source
A Computable Economist’s Perspective on Computational Complexity [PDF]
, 2007 A computable economist's view of the world of computational complexity theory is described. This means the model of computation underpinning theories of computational complexity plays a central role.
Vela Velupillai, K.
core
Computational Complexity as an Ultimate Constraint on Evolution
Genetics, 2019 Experiments show that evolutionary fitness landscapes can have a rich combinatorial structure due to epistasis. For some landscapes, this structure can produce a computational constraint that prevents evolution from finding local fitness optima—thus ...
Artem Kaznatcheev
semanticscholar +1 more source
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
, 2015 We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this theorem was known).
Pich, Ján
core +1 more source
The computational complexity of Kauffman nets and the P versus NP problem
, 2005 Complexity theory as practiced by physicists and computational complexity theory as practiced by computer scientists both characterize how difficult it is to solve complex problems. Here it is shown that the parameters of a specific model can be adjusted
B. Derrida +13 more
core +1 more source
Toward A Better Understanding of Perceived Complexity in Music: A Commentary on Eerola (2016)
Empirical Musicology Review, 2016 Eerola (2016) evaluates models of musical complexity based on expectancy violation and information theory. This commentary notes the deep relationship between these two phenomena, and argues for a more active partnership between computational and ...
Elizabeth Hellmuth Margulis
doaj +1 more source
Parameterized Uniform Complexity in Numerics: from Smooth to Analytic, from NP-hard to Polytime [PDF]
, 2012 The synthesis of classical Computational Complexity Theory with Recursive Analysis provides a quantitative foundation to reliable numerics. Here the operators of maximization, integration, and solving ordinary differential equations are known to map ...
Kawamura, Akitoshi +3 more
core