Results 81 to 90 of about 5,071,272 (326)

Translophagy—A potential link between autophagy impairment and translational errors

open access: yesFEBS Letters, EarlyView.
Neurodegenerative diseases are characterised by the accumulation of abnormal proteins and protein aggregates, but their origin often remains unknown. We propose that selective autophagy removes damaged protein‐making machinery, preventing errors during protein synthesis.
Mykola V. Korolchuk   +11 more
wiley   +1 more source

TWO-FACTOR AUTHENTICATION PROTOCOL IN ACCESS CONTROL SYSTEMS

open access: yesInformation and Telecommunication Sciences, 2023
Background. To ensure the protection of the biometric access control system used in unsecured communication channels, it is necessary to exclude the storage and transfer, transfer of biometric data as well as sequences generated on their basis. The paper
Ірина Стрелковська   +2 more
doaj   +1 more source

Circuit Complexity, Proof Complexity, and Polynomial Identity Testing

open access: yesJournal of the ACM, 2018
We introduce a new and natural algebraic proof system, whose complexity measure is essentially the algebraic circuit size of Nullstellensatz certificates.
Joshua A. Grochow, T. Pitassi
semanticscholar   +1 more source

Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness [PDF]

open access: yesTOCT, 2014
We present and study a framework in which one can present alternation-based lower bounds on proof length in proof systems for quantified Boolean formulas.
Hubie Chen
semanticscholar   +1 more source

The proof complexity of linear algebra

open access: yesAnnals of Pure and Applied Logic, 2003
The authors analyze the complexity of the concepts needed to prove the basic theorems of linear algebra. One of the important results obtained in this paper is that the Cayley-Hamilton theorem enjoys a feasible proof. The analysis is carried out by making use of three formal theories, each of which is carefully designed so as to examine the basic ...
Michael Soltys, Stephen A. Cook
openaire   +2 more sources

Complexity, Governance and Networks: Introduction to the Inaugural Issue

open access: yes, 2014
From the introduction: 1. Yet Another Journal? Why is it necessary to publish a new journal about complexity, governance, and networks? There has been an increasing interest in complexity, governance, and network studies in recent decades.
Morçöl, Göktuğ   +2 more
core   +1 more source

Artificial molecular machines and motors—Design and control of nanoscale motion

open access: yesFEBS Letters, EarlyView.
Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley   +1 more source

On the Complexity of the Natural Deduction Proof Search Algorithm [PDF]

open access: yes, 2017
We present our first account of the complexity of natural deduction proof search algorithms. Though we target the complexity for natural deduction for temporal logic, here we only tackle classical case, comparing the classical part of the proof search ...
Bolotov, A.   +2 more
core  

Recursive Program Optimization Through Inductive Synthesis Proof Transformation [PDF]

open access: yes, 1999
The research described in this paper involved developing transformation techniques which increase the efficiency of the noriginal program, the source, by transforming its synthesis proof into one, the target, which yields a computationally more efficient
Bundy, Alan   +5 more
core   +1 more source

What makes a “regime complex” complex? It depends

open access: yes, 2021
What makes the collections of international institutions or regimes governing various domains—called in theliterature regime, institutional, or governance complexes—“complex”?
Hollway, James
core   +1 more source

Home - About - Disclaimer - Privacy