Статті в журналах з теми "Circuit booléen"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Circuit booléen".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Mokhtarnia, Hossein, Shahram Etemadi Borujeni, and Mohammad Saeed Ehsani. "Automatic Test Pattern Generation Through Boolean Satisfiability for Testing Bridging Faults." Journal of Circuits, Systems and Computers 28, no. 14 (February 20, 2019): 1950240. http://dx.doi.org/10.1142/s0218126619502402.
Повний текст джерелаMatrosova, Angela Yu, Victor A. Provkin, and Valentina V. Andreeva. "Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions." Izvestiya of Saratov University. New Series. Series: Mathematics. Mechanics. Informatics 20, no. 4 (2020): 517–26. http://dx.doi.org/10.18500/1816-9791-2020-20-4-517-526.
Повний текст джерелаLimaye, Nutan, Srikanth Srinivasan, and Sébastien Tavenas. "Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits." Communications of the ACM 67, no. 2 (January 25, 2024): 101–8. http://dx.doi.org/10.1145/3611094.
Повний текст джерелаBorodina, Yulia V. "Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs." Discrete Mathematics and Applications 30, no. 5 (October 27, 2020): 303–6. http://dx.doi.org/10.1515/dma-2020-0026.
Повний текст джерелаAgrawal, Nishant. "Automatic Test Pattern Generation using Grover’s Algorithm." International Journal for Research in Applied Science and Engineering Technology 9, no. VI (June 14, 2021): 2373–79. http://dx.doi.org/10.22214/ijraset.2021.34837.
Повний текст джерелаLi, Hongtao, Chunbiao Li, Zeshi Yuan, Wen Hu, and Xiaochen Zhen. "A New Class of Chaotic Circuit with Logic Elements." Journal of Circuits, Systems and Computers 24, no. 09 (August 27, 2015): 1550136. http://dx.doi.org/10.1142/s0218126615501364.
Повний текст джерелаPrihozhy, Anatoly A. "Synthesis of quantum circuits based on incompletely specified functions and if-decision diagrams." Journal of the Belarusian State University. Mathematics and Informatics, no. 3 (December 14, 2021): 84–97. http://dx.doi.org/10.33581/2520-6508-2021-3-84-97.
Повний текст джерелаYOUNES, AHMED. "REDUCING QUANTUM COST OF REVERSIBLE CIRCUITS FOR HOMOGENEOUS BOOLEAN FUNCTIONS." Journal of Circuits, Systems and Computers 19, no. 07 (November 2010): 1423–34. http://dx.doi.org/10.1142/s0218126610006736.
Повний текст джерелаHou, Yue Wei, Xin Xu, Wei Wang, Xiao Bo Tian, and Hai Jun Liu. "Titanium Oxide Memristor Based Digital Encoder Circuit." Applied Mechanics and Materials 644-650 (September 2014): 3430–33. http://dx.doi.org/10.4028/www.scientific.net/amm.644-650.3430.
Повний текст джерелаBardales, Andrea C., Quynh Vo, and Dmitry M. Kolpashchikov. "Singleton {NOT} and Doubleton {YES; NOT} Gates Act as Functionally Complete Sets in DNA-Integrated Computational Circuits." Nanomaterials 14, no. 7 (March 28, 2024): 600. http://dx.doi.org/10.3390/nano14070600.
Повний текст джерелаPopkov, Kirill A. "Lower bounds for lengths of single tests for Boolean circuits." Discrete Mathematics and Applications 29, no. 1 (February 25, 2019): 23–33. http://dx.doi.org/10.1515/dma-2019-0004.
Повний текст джерелаMondal, Joyati, Bappaditya Mondal, Dipak Kumar Kole, Hafizur Rahaman, and Debesh Kumar Das. "Boolean Difference Technique for Detecting All Missing Gate and Stuck-at Faults in Reversible Circuits." Journal of Circuits, Systems and Computers 28, no. 12 (November 2019): 1950212. http://dx.doi.org/10.1142/s0218126619502128.
Повний текст джерелаKhan, Wilayat, Farrukh Aslam Khan, Abdelouahid Derhab, and Adi Alhudhaif. "CoCEC: An Automatic Combinational Circuit Equivalence Checker Based on the Interactive Theorem Prover." Complexity 2021 (May 25, 2021): 1–12. http://dx.doi.org/10.1155/2021/5525539.
Повний текст джерелаROZUM, JORDAN C., and RÉKA ALBERT. "CONTROLLING THE CELL CYCLE RESTRICTION SWITCH ACROSS THE INFORMATION GRADIENT." Advances in Complex Systems 22, no. 07n08 (November 2019): 1950020. http://dx.doi.org/10.1142/s0219525919500206.
Повний текст джерелаRedkin, Nikolay P. "The generalized complexity of linear Boolean functions." Discrete Mathematics and Applications 30, no. 1 (February 25, 2020): 39–44. http://dx.doi.org/10.1515/dma-2020-0004.
Повний текст джерелаLiu, Hui, Fukun Li, and Yilin Fan. "Optimizing the Quantum Circuit for Solving Boolean Equations Based on Grover Search Algorithm." Electronics 11, no. 15 (August 8, 2022): 2467. http://dx.doi.org/10.3390/electronics11152467.
Повний текст джерелаLozhkin, Sergei A., and Vadim S. Zizov. "Asymptotically sharp estimates for the area of multiplexers in the cellular circuit model." Discrete Mathematics and Applications 34, no. 2 (April 1, 2024): 103–15. http://dx.doi.org/10.1515/dma-2024-0009.
Повний текст джерелаSteinbach, Bernd, and Christian Posthoff. "Compact XOR-bi-decomposition for lattices of Boolean functions." Facta universitatis - series: Electronics and Energetics 31, no. 2 (2018): 223–40. http://dx.doi.org/10.2298/fuee1802223s.
Повний текст джерелаSapozhnikov, Valeriy, Vladimir Sapozhnikov, Dmitriy Efanov, and Dmitriy Pyvovarov. "Application of constant-weight code "1-out-if-5" for the organization of combinational circuits check." Proceedings of Petersburg Transport University, no. 2 (June 20, 2017): 307–19. http://dx.doi.org/10.20295/1815-588x-2017-2-307-319.
Повний текст джерелаFan, Austen Z., Paraschos Koutris, and Hangdong Zhao. "Tight Bounds of Circuits for Sum-Product Queries." Proceedings of the ACM on Management of Data 2, no. 2 (May 10, 2024): 1–20. http://dx.doi.org/10.1145/3651588.
Повний текст джерелаEfanov, Dmitriy, and Eseniya Elina. "Study of algorithms for synthesis of self-checking digital devices based on Boolean correction of signals using weighted Bose – Lin codes." Transport automation research 10, no. 1 (March 17, 2024): 74–99. http://dx.doi.org/10.20295/2412-9186-2024-10-01-74-99.
Повний текст джерелаRushdi, Ali Muhammad Ali, and Waleed Ahmad. "Digital Circuit Design Utilizing Equation Solving over ‘Big’ Boolean Algebras." International Journal of Mathematical, Engineering and Management Sciences 3, no. 4 (December 1, 2018): 404–28. http://dx.doi.org/10.33889/ijmems.2018.3.4-029.
Повний текст джерелаYasmin, Rojoba, and Russell Deaton. "Logical computation with self-assembling electric circuits." PLOS ONE 17, no. 12 (December 7, 2022): e0278033. http://dx.doi.org/10.1371/journal.pone.0278033.
Повний текст джерелаIllner, Petr, and Petr Kučera. "A Compiler for Weak Decomposable Negation Normal Form." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 9 (March 24, 2024): 10562–70. http://dx.doi.org/10.1609/aaai.v38i9.28926.
Повний текст джерелаChen, Bor-Sen, Chih-Yuan Hsu, and Jing-Jia Liou. "Robust Design of Biological Circuits: Evolutionary Systems Biology Approach." Journal of Biomedicine and Biotechnology 2011 (2011): 1–14. http://dx.doi.org/10.1155/2011/304236.
Повний текст джерелаBibilo, P. N., and V. I. Romanov. "Experimental Study of Algorithms for Minimization of Binary Decision Diagrams using Algebraic Representations of Cofactors." Programmnaya Ingeneria 13, no. 2 (February 17, 2022): 51–67. http://dx.doi.org/10.17587/prin.13.51-67.
Повний текст джерелаBibilo, P. N. "Synthesis of Modular Multipliers." Programmnaya Ingeneria 14, no. 8 (August 14, 2023): 377–87. http://dx.doi.org/10.17587/prin.14.377-387.
Повний текст джерелаBanik, Subhadeep, and Francesco Regazzoni. "Compact Circuits for Efficient Möbius Transform." IACR Transactions on Cryptographic Hardware and Embedded Systems 2024, no. 2 (March 12, 2024): 481–521. http://dx.doi.org/10.46586/tches.v2024.i2.481-521.
Повний текст джерелаDatta, Rajesh Kumar. "CVM: Crossbar-based Circuit Verification through Modeling." Indian Journal of VLSI Design 3, no. 2 (September 30, 2023): 1–4. http://dx.doi.org/10.54105/ijvlsid.b1219.093223.
Повний текст джерелаBach, Bao Gia, Akash Kundu, Tamal Acharya, and Aritra Sarkar. "Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis." Entropy 25, no. 5 (May 7, 2023): 763. http://dx.doi.org/10.3390/e25050763.
Повний текст джерелаBerndt, Augusto André Souza, Brunno Abreu, Isac S. Campos, Bryan Lima, Mateus Grellert, Jonata T. Carvalho, and Cristina Meinhardt. "CGP-based Logic Flow: Optimizing Accuracy and Size of Approximate Circuits." Journal of Integrated Circuits and Systems 17, no. 1 (April 30, 2022): 1–12. http://dx.doi.org/10.29292/jics.v17i1.546.
Повний текст джерелаEfanov, D. V., and M. V. Zueva. "Modified Hamming Codes in Computing Devices Technical Diagnostic Systems." Informacionnye Tehnologii 29, no. 1 (January 19, 2023): 12–22. http://dx.doi.org/10.17587/it.29.12-22.
Повний текст джерелаSeo, Jinyoung, Sungi Kim, Ha H. Park, Da Yeon Choi, and Jwa-Min Nam. "Nano-bio-computing lipid nanotablet." Science Advances 5, no. 2 (February 2019): eaau2124. http://dx.doi.org/10.1126/sciadv.aau2124.
Повний текст джерелаWille, Robert, and Rolf Drechsler. "BDD-Based Synthesis of Reversible Logic." International Journal of Applied Metaheuristic Computing 1, no. 4 (October 2010): 25–41. http://dx.doi.org/10.4018/jamc.2010100102.
Повний текст джерелаBIRGET, JEAN-CAMILLE. "FACTORIZATIONS OF THE THOMPSON–HIGMAN GROUPS, AND CIRCUIT COMPLEXITY." International Journal of Algebra and Computation 18, no. 02 (March 2008): 285–320. http://dx.doi.org/10.1142/s0218196708004457.
Повний текст джерелаAwwad, Mohamad. "FROM BOOLE’S LOGIC TO BOOLEAN APPLICATIONS IN COMPUTER SCIENCE." Educational Discourse: collection of scientific papers, no. 32(4) (May 5, 2021): 18–25. http://dx.doi.org/10.33930/ed.2019.5007.32(4)-2.
Повний текст джерелаSuman, Dr J. V., and Nekkali Ramya. "Harnessing Tunnel Field-Effect Transistors for Boolean Function Implementation." INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 07, no. 12 (December 30, 2023): 1–13. http://dx.doi.org/10.55041/ijsrem27821.
Повний текст джерелаPashukov, Artem. "Application of Weight-Based Sum Codes at the Synthesis of Circuits for Built-in Control by Boolean Complement Method." Automation on transport 8, no. 1 (March 15, 2022): 101–14. http://dx.doi.org/10.20295/2412-9186-2022-8-1-101-114.
Повний текст джерелаElliott, Conal. "Timely Computation." Proceedings of the ACM on Programming Languages 7, ICFP (August 30, 2023): 895–919. http://dx.doi.org/10.1145/3607861.
Повний текст джерелаDong, Zhekang, Donglian Qi, Yufei He, Zhao Xu, Xiaofang Hu, and Shukai Duan. "Easily Cascaded Memristor-CMOS Hybrid Circuit for High-Efficiency Boolean Logic Implementation." International Journal of Bifurcation and Chaos 28, no. 12 (November 2018): 1850149. http://dx.doi.org/10.1142/s0218127418501493.
Повний текст джерелаBen-Festus, B. N., M. O. Osinowo, and Ben Festus. "Design and Construction of a Digital Logic Training Module for Laboratory Experimentation." International Journal of Research and Innovation in Applied Science VIII, no. VII (2023): 93–98. http://dx.doi.org/10.51584/ijrias.2023.8511.
Повний текст джерелаK, Alice, and Surya K. "An instance of Satisfiability Problem learnt with Instance based, Decision trees, Naive Bayes." Knowledge Transactions on Applied Machine Learning 01, no. 04 (September 20, 2023): 21–30. http://dx.doi.org/10.59567/ktaml.v1.04.03.
Повний текст джерелаRepe, Madhavi, and Sanjay Koli. "A Solution to VLSI: Digital Circuits Design in Quantum Dot Cellular Automata Technology." International Journal of Electrical and Electronics Research 11, no. 3 (August 10, 2023): 696–704. http://dx.doi.org/10.37391/ijeer.110309.
Повний текст джерелаMukherjee, Shyamapada, and Suchismita Roy. "Via-Aware Dogleg Routing Using Boolean Satisfiability." Journal of Circuits, Systems and Computers 26, no. 04 (December 6, 2016): 1750064. http://dx.doi.org/10.1142/s0218126617500645.
Повний текст джерелаConstantinides, G. A. "Rethinking arithmetic for deep neural networks." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 378, no. 2166 (January 20, 2020): 20190051. http://dx.doi.org/10.1098/rsta.2019.0051.
Повний текст джерелаvon zur Gathen, Joachim, and Gadiel Seroussi. "Boolean circuits versus arithmetic circuits." Information and Computation 91, no. 1 (March 1991): 142–54. http://dx.doi.org/10.1016/0890-5401(91)90078-g.
Повний текст джерелаKumaresan, Raja Sekar, Marshal Raj, and Lakshminarayanan Gopalakrishnan. "Design and implementation of a nano magnetic logic barrel shifter using beyond-CMOS technology." Journal of Electrical Engineering 73, no. 1 (February 1, 2022): 1–10. http://dx.doi.org/10.2478/jee-2022-0001.
Повний текст джерелаRahman, M. Sazadur, Adib Nahiyan, Fahim Rahman, Saverio Fazzari, Kenneth Plaks, Farimah Farahmandi, Domenic Forte, and Mark Tehranipoor. "Security Assessment of Dynamically Obfuscated Scan Chain Against Oracle-guided Attacks." ACM Transactions on Design Automation of Electronic Systems 26, no. 4 (April 2021): 1–27. http://dx.doi.org/10.1145/3444960.
Повний текст джерелаHoiriyah, Hoiriyah. "SIMULASI GERBANG DASAR LOGIKA DALAM APLIKASI." Jurnal Teknik Informatika dan Elektro 2, no. 2 (November 21, 2022): 01–08. http://dx.doi.org/10.55542/jurtie.v2i2.405.
Повний текст джерелаTAYARI, MAHSHID, and MOHAMMAD ESHGHI. "DESIGN OF 3-INPUT REVERSIBLE PROGRAMMABLE LOGIC ARRAY." Journal of Circuits, Systems and Computers 20, no. 02 (April 2011): 283–97. http://dx.doi.org/10.1142/s0218126611007256.
Повний текст джерела