These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

151 related articles for article (PubMed ID: 9419335)

  • 1. P/NP, and the quantum field computer.
    Freedman MH
    Proc Natl Acad Sci U S A; 1998 Jan; 95(1):98-101. PubMed ID: 9419335
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Limit, logic, and computation.
    Freedman MH
    Proc Natl Acad Sci U S A; 1998 Jan; 95(1):95-7. PubMed ID: 9419334
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Universal Memcomputing Machines.
    Traversa FL; Di Ventra M
    IEEE Trans Neural Netw Learn Syst; 2015 Nov; 26(11):2702-15. PubMed ID: 25667360
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Computational complexity of ecological and evolutionary spatial dynamics.
    Ibsen-Jensen R; Chatterjee K; Nowak MA
    Proc Natl Acad Sci U S A; 2015 Dec; 112(51):15636-41. PubMed ID: 26644569
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states.
    Traversa FL; Ramella C; Bonani F; Di Ventra M
    Sci Adv; 2015 Jul; 1(6):e1500031. PubMed ID: 26601208
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations.
    Troyer M; Wiese UJ
    Phys Rev Lett; 2005 May; 94(17):170201. PubMed ID: 15904269
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Ensemble quantum computing by NMR spectroscopy.
    Cory DG; Fahmy AF; Havel TF
    Proc Natl Acad Sci U S A; 1997 Mar; 94(5):1634-9. PubMed ID: 9050830
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Robust quantum optimizer with full connectivity.
    Nigg SE; Lörch N; Tiwari RP
    Sci Adv; 2017 Apr; 3(4):e1602273. PubMed ID: 28435880
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Parallel computation with molecular-motor-propelled agents in nanofabricated networks.
    Nicolau DV; Lard M; Korten T; van Delft FC; Persson M; Bengtsson E; Månsson A; Diez S; Linke H; Nicolau DV
    Proc Natl Acad Sci U S A; 2016 Mar; 113(10):2591-6. PubMed ID: 26903637
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Amoeba-inspired nanoarchitectonic computing: solving intractable computational problems using nanoscale photoexcitation transfer dynamics.
    Aono M; Naruse M; Kim SJ; Wakabayashi M; Hori H; Ohtsu M; Hara M
    Langmuir; 2013 Jun; 29(24):7557-64. PubMed ID: 23565603
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Experimental approximation of the Jones polynomial with one quantum bit.
    Passante G; Moussa O; Ryan CA; Laflamme R
    Phys Rev Lett; 2009 Dec; 103(25):250501. PubMed ID: 20366244
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Measurement-based classical computation.
    Hoban MJ; Wallman JJ; Anwar H; Usher N; Raussendorf R; Browne DE
    Phys Rev Lett; 2014 Apr; 112(14):140505. PubMed ID: 24765935
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Insight and analysis problem solving in microbes to machines.
    Clark KB
    Prog Biophys Mol Biol; 2015 Nov; 119(2):183-93. PubMed ID: 26278642
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Computing exponentially faster: implementing a non-deterministic universal Turing machine using DNA.
    Currin A; Korovin K; Ababi M; Roper K; Kell DB; Day PJ; King RD
    J R Soc Interface; 2017 Mar; 14(128):. PubMed ID: 28250099
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Training Variational Quantum Algorithms Is NP-Hard.
    Bittel L; Kliesch M
    Phys Rev Lett; 2021 Sep; 127(12):120502. PubMed ID: 34597099
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Revisiting the simulation of quantum Turing machines by quantum circuits.
    Molina A; Watrous J
    Proc Math Phys Eng Sci; 2019 Jun; 475(2226):20180767. PubMed ID: 31293355
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Quantum verification of NP problems with single photons and linear optics.
    Zhang A; Zhan H; Liao J; Zheng K; Jiang T; Mi M; Yao P; Zhang L
    Light Sci Appl; 2021 Aug; 10(1):169. PubMed ID: 34408129
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Time-reversal-based SU(2) x Sn scalar invariants as (Lie Algebraic) group measures: a structured overview of generalised democratic-recoupled, uniform non-Abelian [AX]n NMR spin systems, as abstract [Formula: see text] chain networks.
    Temme FP
    J Magn Reson; 2004 Mar; 167(1):119-32. PubMed ID: 14987606
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Reaction rate theory: what it was, where is it today, and where is it going?
    Pollak E; Talkner P
    Chaos; 2005 Jun; 15(2):26116. PubMed ID: 16035918
    [TBL] [Abstract][Full Text] [Related]  

  • 20. On the computational complexity of binary and analog symmetric hopfield nets.
    Sima J; Orponen P; Antti-Poika T
    Neural Comput; 2000 Dec; 12(12):2965-89. PubMed ID: 11112262
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.