Results 71 to 80 of about 1,402,894 (317)
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
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
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
Molecular Oncology, EarlyView.The noncoding region of the genome plays a key role in regulating gene expression, and mutations within these regions are capable of altering it. Researchers have identified multiple functional noncoding mutations associated with increased cancer risk in the genome of breast cancer patients.
Arnau Cuy Saqués +3 more
wiley +1 more source
The Complexity of Planning Revisited - A Parameterized Analysis [PDF]
, 2012 The early classifications of the computational complexity of planning under various restrictions in STRIPS (Bylander) and SAS+ (Baeckstroem and Nebel) have influenced following research in planning in many ways. We go back and reanalyse their subclasses,
Baeckstroem, Christer +4 more
core
Strength through diversity: how cancers thrive when clones cooperate
Molecular Oncology, EarlyView.Intratumor heterogeneity can offer direct benefits to the tumor through cooperation between different clones. In this review, Kuiken et al. discuss existing evidence for clonal cooperativity to identify overarching principles, and highlight how novel technological developments could address remaining open questions.
Marije C. Kuiken +3 more
wiley +1 more source
On nonintegral vertices of 3-SAT problem relaxation polytope
Моделирование и анализ информационных систем, 2010 New facts characterizing the vertex set of 3-SAT problem relaxation polytope are established. In particular, the question of preservation of nonintegral vertices under additional linear constraints of stronger relaxations is examined.
A. V. Nikolaev
doaj
Two-dimensional Kolmogorov complexity and an empirical validation of the Coding theorem method by compressibility [PDF]
PeerJ Computer Science, 2015 We propose a measure based upon the fundamental theoretical concept in algorithmic information theory that provides a natural approach to the problem of evaluating n-dimensional complexity by using an n-dimensional deterministic Turing machine.
Hector Zenil +3 more
doaj +2 more sources
, 2019 We believe that economic design and computational complexity---while already important to each other---should become even more important to each other with each passing year. But for that to happen, experts in on the one hand such areas as social choice,
A Appel +21 more
core +1 more source
Molecular Oncology, EarlyView.Combining PTEN protein assessment and transcriptomic profiling of prostate tumors, we uncovered a network enriched in senescence and extracellular matrix (ECM) programs associated with PTEN loss and conserved in a mouse model. We show that PTEN‐deficient cells trigger paracrine remodeling of the surrounding stroma and this information could help ...
Ivana Rondon‐Lorefice +16 more
wiley +1 more source