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.
128 related articles for article (PubMed ID: 32117514)
1. 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]
2. Boolean Functions with Multiplicative Complexity 3 and 4. Çalık Ç; Turan MS; Peralta R Cryptogr Commun; 2020; 12():. PubMed ID: 33654507 [TBL] [Abstract][Full Text] [Related]
3. The Multiplicative Complexity of 6-variable Boolean Functions. Çalık Ç; Turan MS; Peralta R Cryptogr Commun; 2018; 11(1):93-107. PubMed ID: 33442441 [TBL] [Abstract][Full Text] [Related]
4. Improved upper bounds for the expected circuit complexity of dense systems of linear equations over GF(2). Visconti A; Schiavo CV; Peralta R Inf Process Lett; 2018; 137():. PubMed ID: 30996399 [TBL] [Abstract][Full Text] [Related]
5. Better Circuits for Binary Polynomial Multiplication. Find MG; Peralta R IEEE Trans Comput; 2019; 68():. PubMed ID: 31579277 [TBL] [Abstract][Full Text] [Related]
6. Optimizing implementations of linear layers using two and higher input XOR gates. Kurt Pehlivanoğlu M; Demir MA PeerJ Comput Sci; 2024; 10():e1820. PubMed ID: 38269329 [TBL] [Abstract][Full Text] [Related]
7. Implementation of novel boolean logic gates for IMPLICATION and XOR functions using riboregulators. Chen C; Wu Q; Ke Q; Wang T; Zhang Y; Wei F; Wang X; Liu G Bioengineered; 2022 Jan; 13(1):1235-1248. PubMed ID: 34983299 [TBL] [Abstract][Full Text] [Related]
8. 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]
9. Distributed Implementation of Boolean Functions by Transcriptional Synthetic Circuits. Al-Radhawi MA; Tran AP; Ernst EA; Chen T; Voigt CA; Sontag ED ACS Synth Biol; 2020 Aug; 9(8):2172-2187. PubMed ID: 32589837 [TBL] [Abstract][Full Text] [Related]
10. Periodic symmetric functions, serial addition, and multiplication with neural networks. Cotofana S; Vassiliadis S IEEE Trans Neural Netw; 1998; 9(6):1118-28. PubMed ID: 18255796 [TBL] [Abstract][Full Text] [Related]
11. Singleton {NOT} and Doubleton {YES; NOT} Gates Act as Functionally Complete Sets in DNA-Integrated Computational Circuits. Bardales AC; Vo Q; Kolpashchikov DM Nanomaterials (Basel); 2024 Mar; 14(7):. PubMed ID: 38607134 [TBL] [Abstract][Full Text] [Related]
12. In silico design and in vivo implementation of yeast gene Boolean gates. Marchisio MA J Biol Eng; 2014 Feb; 8(1):6. PubMed ID: 24485181 [TBL] [Abstract][Full Text] [Related]
14. Minimum complexity drives regulatory logic in Boolean models of living systems. Subbaroyan A; Martin OC; Samal A PNAS Nexus; 2022 Mar; 1(1):pgac017. PubMed ID: 36712790 [TBL] [Abstract][Full Text] [Related]
16. Sign-representation of Boolean functions using a small number of monomials. Oztop E Neural Netw; 2009 Sep; 22(7):938-48. PubMed ID: 19423284 [TBL] [Abstract][Full Text] [Related]
17. A logical way to reprogram plants. Ferreira SS; Anderson CE; Antunes MS Biochem Biophys Res Commun; 2023 Apr; 654():80-86. PubMed ID: 36898227 [TBL] [Abstract][Full Text] [Related]