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.
97 related articles for article (PubMed ID: 31579277)
1. Better Circuits for Binary Polynomial Multiplication. Find MG; Peralta R IEEE Trans Comput; 2019; 68():. PubMed ID: 31579277 [TBL] [Abstract][Full Text] [Related]
2. Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. Brandão LTAN; Çalık Ç; Turan MS; Peralta R Cryptogr Commun; 2019; 11(6):. PubMed ID: 32117514 [TBL] [Abstract][Full Text] [Related]
3. Analog Computation by DNA Strand Displacement Circuits. Song T; Garg S; Mokhtar R; Bui H; Reif J ACS Synth Biol; 2016 Aug; 5(8):898-912. PubMed ID: 27363950 [TBL] [Abstract][Full Text] [Related]
4. Quantum Binary Field Multiplication with Optimized Toffoli Depth and Extension to Quantum Inversion. Jang K; Kim W; Lim S; Kang Y; Yang Y; Seo H Sensors (Basel); 2023 Mar; 23(6):. PubMed ID: 36991867 [TBL] [Abstract][Full Text] [Related]
5. Small Low-Depth Circuits for Cryptographic Applications. Boyar J; Find MG; Peralta R Cryptogr Commun; 2019; 11():. PubMed ID: 30996763 [TBL] [Abstract][Full Text] [Related]
6. A two-pronged progress in structured dense matrixvector multiplication. De Sa C; Gu A; Puttagunta R; Ré C; Rudra A Proc Annu ACM SIAM Symp Discret Algorithms; 2018 Jan; 2018():1060-1079. PubMed ID: 31130802 [TBL] [Abstract][Full Text] [Related]
7. An Algorithm for the Factorization of Split Quaternion Polynomials. Scharler DF; Schröcker HP Adv Appl Clifford Algebr; 2021; 31(3):29. PubMed ID: 34720306 [TBL] [Abstract][Full Text] [Related]
8. Improved Classical Simulation of Quantum Circuits Dominated by Clifford Gates. Bravyi S; Gosset D Phys Rev Lett; 2016 Jun; 116(25):250501. PubMed ID: 27391708 [TBL] [Abstract][Full Text] [Related]
9. Quantum Circuit Optimization for Solving Discrete Logarithm of Binary Elliptic Curves Obeying the Nearest-Neighbor Constrained. Liu J; Wang H; Ma Z; Duan Q; Fei Y; Meng X Entropy (Basel); 2022 Jul; 24(7):. PubMed ID: 35885178 [TBL] [Abstract][Full Text] [Related]
10. Fitness Probability Distribution of Bit-Flip Mutation. Chicano F; Sutton AM; Whitley LD; Alba E Evol Comput; 2015; 23(2):217-48. PubMed ID: 24885680 [TBL] [Abstract][Full Text] [Related]
11. Polynomial convolution algorithm for matrix multiplication with application for optical computing. Barakat R; Reif J Appl Opt; 1987 Jul; 26(14):2707-11. PubMed ID: 20489949 [TBL] [Abstract][Full Text] [Related]
12. On the computational power of threshold circuits with sparse activity. Uchizawa K; Douglas R; Maass W Neural Comput; 2006 Dec; 18(12):2994-3008. PubMed ID: 17052156 [TBL] [Abstract][Full Text] [Related]
13. Stochastic process design kits for photonic circuits based on polynomial chaos augmented macro-modelling. Waqas A; Melati D; Manfredi P; Melloni A Opt Express; 2018 Mar; 26(5):5894-5907. PubMed ID: 29529789 [TBL] [Abstract][Full Text] [Related]
14. A new generalization of Apostol type Hermite-Genocchi polynomials and its applications. Araci S; Khan WA; Acikgoz M; Özel C; Kumam P Springerplus; 2016; 5(1):860. PubMed ID: 27386309 [TBL] [Abstract][Full Text] [Related]
15. The trigonometric polynomial like Bernstein polynomial. Han X ScientificWorldJournal; 2014; 2014():174716. PubMed ID: 25276845 [TBL] [Abstract][Full Text] [Related]
16. Sets of range uniqueness for multivariate polynomials and linear functions with rank Halbeisen L; Hungerbühler N; Schumacher S; Xian Yau G Linear Multilinear Algebra; 2022; 70(20):5642-5660. PubMed ID: 36624783 [TBL] [Abstract][Full Text] [Related]
17. A learning rule for very simple universal approximators consisting of a single layer of perceptrons. Auer P; Burgsteiner H; Maass W Neural Netw; 2008 Jun; 21(5):786-95. PubMed ID: 18249524 [TBL] [Abstract][Full Text] [Related]
18. Lengths of factorizations of integer-valued polynomials on Krull domains with prime elements. Fadinger-Held V; Windisch D Arch Math; 2024; 123(2):123-135. PubMed ID: 39071218 [TBL] [Abstract][Full Text] [Related]
19. On the Representational Power of Restricted Boltzmann Machines for Symmetric Functions and Boolean Functions. Gu L; Huang J; Yang L IEEE Trans Neural Netw Learn Syst; 2019 May; 30(5):1335-1347. PubMed ID: 30281484 [TBL] [Abstract][Full Text] [Related]
20. Simple polynomial multiplication algorithms for exact conditional tests of linearity in a logistic model. Tang ML; Hirji KF Comput Methods Programs Biomed; 2002 Jul; 69(1):13-23. PubMed ID: 12088589 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]