Results 291 to 300 of about 8,702,509 (349)
Molecular Complexity Constrained Early Amino Acid Recruitment into the Genetic Code. [PDF]
Hashmi SA, Chok H, Cabrera R, Blanco C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93, 1993
Summary: We study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch's model of a quantum Turing machine (QTM) [\textit{D. Deutsch}, Proc. Roy. Soc. Lond. Ser. A 400, 97-117 (1985)].
Ethan S. Bernstein, U. Vazirani
semanticscholar +3 more sources
Summary: We study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch's model of a quantum Turing machine (QTM) [\textit{D. Deutsch}, Proc. Roy. Soc. Lond. Ser. A 400, 97-117 (1985)].
Ethan S. Bernstein, U. Vazirani
semanticscholar +3 more sources
Complexity Theory and the Social Sciences
, 2022This expanded and updated edition of Complexity Theory and the Social Sciences: The State of the Art revisits the use of complexity theory across the social sciences and demonstrates how complexity informs approaches to various contemporary issues in the
D. Byrne
semanticscholar +1 more source
Oberwolfach Reports, 2006
The workshop Complexity Theory was organised by Joachim von zur Gathen (Bonn), Oded Goldreich (Rehovot), Claus-Peter Schnorr (Frankfurt), and Madhu Sudan (Cambridge). The workshop was held on June 5th–11th 2005, and attended by approximately 50 participants spanning a wide range of interests ...
Joachim von zur Gathen +3 more
openaire +1 more source
The workshop Complexity Theory was organised by Joachim von zur Gathen (Bonn), Oded Goldreich (Rehovot), Claus-Peter Schnorr (Frankfurt), and Madhu Sudan (Cambridge). The workshop was held on June 5th–11th 2005, and attended by approximately 50 participants spanning a wide range of interests ...
Joachim von zur Gathen +3 more
openaire +1 more source
Exploring the Relevance of Complexity Theory for Mixed Methods Research
Journal of Mixed Methods Research, 2020While the field of mixed methods has discussed complexity theory, more clarification regarding its conceptualization is needed. Accordingly, we first review how various fields have interpreted and applied the central ideas of complexity theory in the ...
Leanne M. Kallemeyn +2 more
semanticscholar +1 more source
SIGACT News Complexity Theory Column 124 Meta-Mathematics of Computational Complexity Theory
Sigact NewsWe survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory.
I. C. Oliveira
semanticscholar +1 more source
ACM SIGACT News, 2001
We present high-level technical summaries of five recent results on the computational complexity of the shortest lattice vector problem.
openaire +1 more source
We present high-level technical summaries of five recent results on the computational complexity of the shortest lattice vector problem.
openaire +1 more source

