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 *

148 related articles for article (PubMed ID: 36359704)

  • 1. Quantum Algorithm for Variant Maximum Satisfiability.
    Alasow A; Jin P; Perkowski M
    Entropy (Basel); 2022 Nov; 24(11):. PubMed ID: 36359704
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Satisfiability-unsatisfiability transition in the adversarial satisfiability problem.
    Bardoscia M; Nagaj D; Scardicchio A
    Phys Rev E Stat Nonlin Soft Matter Phys; 2014 Mar; 89(3):032128. PubMed ID: 24730811
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions.
    Semenov A; Zaikin O
    Springerplus; 2016; 5():554. PubMed ID: 27190753
    [TBL] [Abstract][Full Text] [Related]  

  • 4. A variable neighborhood Walksat-based algorithm for MAX-SAT problems.
    Bouhmala N
    ScientificWorldJournal; 2014; 2014():798323. PubMed ID: 25177732
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Generalized Toffoli Gate Decomposition Using Ququints: Towards Realizing Grover's Algorithm with Qudits.
    Nikolaeva AS; Kiktenko EO; Fedorov AK
    Entropy (Basel); 2023 Feb; 25(2):. PubMed ID: 36832752
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Generalized Grover's Algorithm for Multiple Phase Inversion States.
    Byrnes T; Forster G; Tessler L
    Phys Rev Lett; 2018 Feb; 120(6):060501. PubMed ID: 29481268
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Quantum exhaustive key search with simplified-DES as a case study.
    Almazrooie M; Samsudin A; Abdullah R; Mutter KN
    Springerplus; 2016; 5(1):1494. PubMed ID: 27652067
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Factoring semi-primes with (quantum) SAT-solvers.
    Mosca M; Verschoor SR
    Sci Rep; 2022 May; 12(1):7982. PubMed ID: 35568707
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Order-to-chaos transition in the hardness of random Boolean satisfiability problems.
    Varga M; Sumi R; Toroczkai Z; Ercsey-Ravasz M
    Phys Rev E; 2016 May; 93(5):052211. PubMed ID: 27300884
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Balanced K-satisfiability and biased random K-satisfiability on trees.
    Sumedha ; Krishnamurthy S; Sahoo S
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 Apr; 87(4):042130. PubMed ID: 23826613
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Boolean satisfiability in quantum compilation.
    Soeken M; Meuli G; Schmitt B; Mozafari F; Riener H; De Micheli G
    Philos Trans A Math Phys Eng Sci; 2020 Feb; 378(2164):20190161. PubMed ID: 31865887
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Operating Quantum States in Single Magnetic Molecules: Implementation of Grover's Quantum Algorithm.
    Godfrin C; Ferhat A; Ballou R; Klyatskaya S; Ruben M; Wernsdorfer W; Balestro F
    Phys Rev Lett; 2017 Nov; 119(18):187702. PubMed ID: 29219608
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Analytic and algorithmic solution of random satisfiability problems.
    Mézard M; Parisi G; Zecchina R
    Science; 2002 Aug; 297(5582):812-5. PubMed ID: 12089451
    [TBL] [Abstract][Full Text] [Related]  

  • 14. An Efficient Steady-State Analysis Method for Large Boolean Networks with High Maximum Node Connectivity.
    Hong C; Hwang J; Cho KH; Shin I
    PLoS One; 2015; 10(12):e0145734. PubMed ID: 26716694
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Complete 3-Qubit Grover search on a programmable quantum computer.
    Figgatt C; Maslov D; Landsman KA; Linke NM; Debnath S; Monroe C
    Nat Commun; 2017 Dec; 8(1):1918. PubMed ID: 29203858
    [TBL] [Abstract][Full Text] [Related]  

  • 16. 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]  

  • 17. Efficient solution of Boolean satisfiability problems with digital memcomputing.
    Bearden SRB; Pei YR; Di Ventra M
    Sci Rep; 2020 Nov; 10(1):19741. PubMed ID: 33184386
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Gate-based quantum computing for protein design.
    Khatami MH; Mendes UC; Wiebe N; Kim PM
    PLoS Comput Biol; 2023 Apr; 19(4):e1011033. PubMed ID: 37043517
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Analog Approach to Constraint Satisfaction Enabled by Spin Orbit Torque Magnetic Tunnel Junctions.
    Wijesinghe P; Liyanagedera C; Roy K
    Sci Rep; 2018 May; 8(1):6940. PubMed ID: 29720596
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Witness of unsatisfiability for a random 3-satisfiability formula.
    Wu LL; Zhou HJ; Alava M; Aurell E; Orponen P
    Phys Rev E Stat Nonlin Soft Matter Phys; 2013 May; 87(5):052807. PubMed ID: 23767584
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.