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
Aggressive prostate cancer is associated with pericyte dysfunction
Molecular Oncology, EarlyView.Tumor‐produced TGF‐β drives pericyte dysfunction in prostate cancer. This dysfunction is characterized by downregulation of some canonical pericyte markers (i.e., DES, CSPG4, and ACTA2) while maintaining the expression of others (i.e., PDGFRB, NOTCH3, and RGS5).
Anabel Martinez‐Romero +11 more
wiley +1 more source
Special Issue “Quantum computation complexity theory and quantum network theory” (Preface) [PDF]
, 2021 Junde Wu
openalex +1 more source
Relativistic Computers and Non-uniform Complexity Theory [PDF]
, 2002 Recent research in theoretical physics on 'Malament-Hogarth space-times' indicates that so-called relativistic computers can be conceived that can carry out certain classically undecidable queries in finite time. We observe that the relativistic Turing machines which model these computations recognize precisely the ?2-sets of the Arithmetical Hierarchy.
Jirí Wiedermann, Jan van Leeuwen
openaire +4 more sources
Why Philosophers Should Care About Computational Complexity [PDF]
, 2011 One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong.
Aaronson, Scott
core +4 more sources
Current trends in single‐cell RNA sequencing applications in diabetes mellitus
FEBS Open Bio, EarlyView.Single‐cell RNA sequencing is a powerful approach to decipher the cellular and molecular landscape at a single‐cell resolution. The rapid development of this technology has led to a wide range of applications, including the detection of cellular and molecular mechanisms and the identification and introduction of novel potential diagnostic and ...
Seyed Sajjad Zadian +6 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
Applications of Kolmogorov complexity to computable model theory [PDF]
Journal of Symbolic Logic, 2007 AbstractIn this paper we answer the following well-known open question in computable model theory. Does there exist a computable not ℵ0-categorical saturated structure with a unique computable isomor-phism type? Our answer is affirmative and uses a construction based on Kolmogorov complexity.
Khoussainov, B. +2 more
openaire +3 more sources
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