Advanced search×

Clinical problem-solving. It's not all in your head.

Kathryn K Towns, Paul E PE Szmitko, Chris C Smith, Allan S AS Detsky, and Ophyr O Mourad

N Engl J Med 365(14):1329-34 (2011) PMID 21991955

DOI: 10.1056/NEJMcps0900533
Version: za2963e q8za6 q8zb2 q8zcb q8zdf q8zef q8zf5 q8zg5
Buy PDF

Similar articles you may find interesting…

  1. Classical and Quantum Algorithms for Testing Equivalence of Group Extensions
    Kevin C Zatloukal

    arXiv:1305.1327 [quant-ph] 6 May 2013

    We show that equivalence of central extensions can be computed Efficiently on a classical computer when the groups are small enough to be Given by their multiplication tables. However, in the model of black box Groups, which allows the groups to be much larger, we show that equivalence can Be comput...
    View PDF
  2. Interdiction Problems on Planar Graphs
    Feng Pan and Aaron Schild

    arXiv:1305.1407 [cs.DS] 7 May 2013

    We introduce approximation algorithms and strong NP-completeness results for Interdiction problems on planar graphs. Interdiction problems are Leader-follower games in which the leader is allowed to delete a certain number Of edges from the graph in order to maximally impede the follower, who is Try...
    View PDF
  3. Polynomial time quantum algorithms for certain bivariate hidden polynomial problems
    Thomas Decker, Peter Hoyer, and Miklos Santha

    arXiv:1305.1543 [quant-ph] 7 May 2013

    We present a new method for solving the hidden polynomial graph problem (HPGP) which is a special case of the hidden polynomial problem (HPP). The new Approach yields an efficient quantum algorithm for the bivariate HPGP even when The input consists of several level set superpositions, a more diffic...
    View PDF