Results 41 to 50 of about 156,901 (262)
Proofs of Proofs of Work with Sublinear Complexity
, 2016 In the setting of blockchain based transaction ledgers we study the problem of “simplified payment verification” (SPV) which refers to the setting of a transaction verifier that wishes to examine the last k blocks of the blockchain (e.g., for the purpose of verification of a certain transaction) using as only advice the genesis block (or some ...
Kiayias, A., Lamprou, N., Stouka, A.-P.
openaire +2 more sources
Journal of Medical Internet Research, 2020 BackgroundThe language gap between health consumers and health professionals has been long recognized as the main hindrance to effective health information comprehension.
Yu, Biyang +3 more
doaj +1 more source
Organoids in pediatric cancer research
FEBS Letters, EarlyView.Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
A Fuzzy Grammar for Evaluating Universality and Complexity in Natural Language
Mathematics, 2022 The paper focuses on linguistic complexity and language universals, which are two important and controversial issues in language research. A Fuzzy Property Grammar for determining the degree of universality and complexity of a natural language is ...
Adrià Torrens-Urrutia +3 more
doaj +1 more source
The Complexity of Propositional Proofs
Bulletin of Symbolic Logic, 2007 AbstractPropositional proof complexity is the study of the sizes of propositional proofs, and more generally, the resources necessary to certify propositional tautologies. Questions about proof sizes have connections with computational complexity, theories of arithmetic, and satisfiability algorithms.
openaire +2 more sources
Gut microbiome and aging—A dynamic interplay of microbes, metabolites, and the immune system
FEBS Letters, EarlyView.Age‐dependent shifts in microbial communities engender shifts in microbial metabolite profiles. These in turn drive shifts in barrier surface permeability of the gut and brain and induce immune activation. When paired with preexisting age‐related chronic inflammation this increases the risk of neuroinflammation and neurodegenerative diseases.
Aaron Mehl, Eran Blacher
wiley +1 more source
A Syntactic Proof of the Decidability of First-Order Monadic Logic
Bulletin of the Section of LogicDecidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided.
Eugenio Orlandelli, Matteo Tesi
doaj +1 more source
How to Prove Work: With Time or Memory
IEEE Access, 2022 Proposed by Dwork and Naor (Crypto’ 92) as an anti-spam technique, proof-of-work is attracting more attention with the boom of cryptocurrencies. A proof-of-work scheme involves two types of participants, $\textit {i.e.}$ , provers and verifiers ...
Xiangyu Su +2 more
doaj +1 more source
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
Hardness amplification in proof complexity
Proceedings of the forty-second ACM symposium on Theory of computing, 2010 We present a general method for converting any family of unsatisfiable CNF formulas that is hard for one of the simplest proof systems, tree resolution, into formulas that require large rank in any proof system that manipulates polynomials or polynomial threshold functions of degree at most k (known as Th(k) proofs).
Paul Beame, Trinh Huynh, Toniann Pitassi
openaire +3 more sources