Results 221 to 230 of about 2,646,616 (265)
Restricted Network Reconstruction from Time Series via Dempster-Shafer Evidence Theory. [PDF]
Entropy (Basel)Zhang C, Xian Y, Yuan X, Li M, Zhang Q.
europepmc +1 more source
Quantum kernel methods for marketing analytics with convergence theory and separation bounds. [PDF]
Sci RepSáez Ortuño L +2 more
europepmc +1 more source
How does human-AI collaboration task complexity affect employee work engagement? The roles of humble leadership and AI self-efficacy. [PDF]
Front PsycholWang B, Liu S, Luo C.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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 +2 more sources
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 +2 more sources
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)].
Bernstein, Ethan, Vazirani, Umesh
openaire +2 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)].
Bernstein, Ethan, Vazirani, Umesh
openaire +2 more sources
2018
Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various sub-areas including arithmetic complexity, Boolean complexity, communication complexity, cryptography, probabilistic proof systems ...
+4 more sources
Computational Complexity Theory is the mathematical study of the intrinsic power and limitations of computational resources like time, space, or randomness. The current workshop focused on recent developments in various sub-areas including arithmetic complexity, Boolean complexity, communication complexity, cryptography, probabilistic proof systems ...
+4 more sources
2011
This book chapter is not available through ChesterRep. ; This book chapter discusses complexity and how complexity relates to healthcare education.
openaire +2 more sources
This book chapter is not available through ChesterRep. ; This book chapter discusses complexity and how complexity relates to healthcare education.
openaire +2 more sources
2005
Computational Complexity Theory is the mathematical study of resources like time, space, or randomness that are required to solve computational problems. The current workshop was focused on recent developments, and the interplay between randomness and computation played a central role in many of them.
openaire +2 more sources
Computational Complexity Theory is the mathematical study of resources like time, space, or randomness that are required to solve computational problems. The current workshop was focused on recent developments, and the interplay between randomness and computation played a central role in many of them.
openaire +2 more sources
P versus NP). Description: Determine whether every problem whose solu-tion can be verified in polynomial time can also be solved in polynomial time. In other words,is:P = NP ?Details:• P = {L ⊆ {0, 1}∗ | ∃ a deterministic Turing machine M and k ∈ N such that ∀x ∈{0, 1}∗, x ∈ L ⇐⇒ M (x) accepts in O(|x|k)}.• NP = {L ⊆ {0, 1}∗ | ∃ a nondeterministic ...
+4 more sources
+4 more sources