Статті в журналах з теми "Multilinear Depth 3 Circuits"
Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями
Ознайомтеся з топ-50 статей у журналах для дослідження на тему "Multilinear Depth 3 Circuits".
Біля кожної праці в переліку літератури доступна кнопка «Додати до бібліографії». Скористайтеся нею – і ми автоматично оформимо бібліографічне посилання на обрану працю в потрібному вам стилі цитування: APA, MLA, «Гарвард», «Чикаго», «Ванкувер» тощо.
Також ви можете завантажити повний текст наукової публікації у форматі «.pdf» та прочитати онлайн анотацію до роботи, якщо відповідні параметри наявні в метаданих.
Переглядайте статті в журналах для різних дисциплін та оформлюйте правильно вашу бібліографію.
Ghosal, Purnata, and B. V. Raghavendra Rao. "On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models." Fundamenta Informaticae 177, no. 1 (December 18, 2020): 69–93. http://dx.doi.org/10.3233/fi-2020-1980.
Повний текст джерелаSaraf, Shubhangi, and Ilya Volkovich. "Black-Box Identity Testing of Depth-4 Multilinear Circuits." Combinatorica 38, no. 5 (December 9, 2017): 1205–38. http://dx.doi.org/10.1007/s00493-016-3460-4.
Повний текст джерелаRaz, Ran, and Amir Yehudayoff. "Lower Bounds and Separations for Constant Depth Multilinear Circuits." computational complexity 18, no. 2 (June 2009): 171–207. http://dx.doi.org/10.1007/s00037-009-0270-8.
Повний текст джерелаChillara, Suryajith. "On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits." ACM Transactions on Computation Theory 13, no. 3 (September 30, 2021): 1–21. http://dx.doi.org/10.1145/3460952.
Повний текст джерелаKarnin, Zohar S., Partha Mukhopadhyay, Amir Shpilka, and Ilya Volkovich. "Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in." SIAM Journal on Computing 42, no. 6 (January 2013): 2114–31. http://dx.doi.org/10.1137/110824516.
Повний текст джерелаKayal, Neeraj, Vineet Nair, and Chandan Saha. "Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits." ACM Transactions on Computation Theory 12, no. 1 (February 25, 2020): 1–27. http://dx.doi.org/10.1145/3369928.
Повний текст джерелаGupta, Ankit, Pritish Kamath, Neeraj Kayal, and Ramprasad Saptharishi. "Arithmetic Circuits: A Chasm at Depth 3." SIAM Journal on Computing 45, no. 3 (January 2016): 1064–79. http://dx.doi.org/10.1137/140957123.
Повний текст джерелаKayal, Neeraj, and Nitin Saxena. "Polynomial Identity Testing for Depth 3 Circuits." computational complexity 16, no. 2 (May 2007): 115–38. http://dx.doi.org/10.1007/s00037-007-0226-9.
Повний текст джерелаFang, M., S. Fenner, F. Green, S. Homer, and Y. Zhang. "Quantum lower bounds for fanout." Quantum Information and Computation 6, no. 1 (January 2006): 46–57. http://dx.doi.org/10.26421/qic6.1-3.
Повний текст джерелаLovett, Shachar, and Emanuele Viola. "Bounded-Depth Circuits Cannot Sample Good Codes." computational complexity 21, no. 2 (March 30, 2012): 245–66. http://dx.doi.org/10.1007/s00037-012-0039-3.
Повний текст джерелаBoyar, Joan, Magnus Gausdal Find, and René Peralta. "Small low-depth circuits for cryptographic applications." Cryptography and Communications 11, no. 1 (March 24, 2018): 109–27. http://dx.doi.org/10.1007/s12095-018-0296-3.
Повний текст джерелаShpilka, A., and A. Wigderson. "Depth-3 arithmetic circuits over fields of characteristic zero." Computational Complexity 10, no. 1 (November 2001): 1–27. http://dx.doi.org/10.1007/pl00001609.
Повний текст джерелаYan, P. Y., and I. Parberry. "Exponential Size Lower Bounds for Some Depth 3 Circuits." Information and Computation 112, no. 1 (July 1994): 117–30. http://dx.doi.org/10.1006/inco.1994.1054.
Повний текст джерелаShpilka, Amir. "Interpolation of Depth-3 Arithmetic Circuits with Two Multiplication Gates." SIAM Journal on Computing 38, no. 6 (January 2009): 2130–61. http://dx.doi.org/10.1137/070694879.
Повний текст джерелаKumar, Mrinal. "On the Power of Border of Depth-3 Arithmetic Circuits." ACM Transactions on Computation Theory 12, no. 1 (February 25, 2020): 1–8. http://dx.doi.org/10.1145/3371506.
Повний текст джерелаWolfovitz, Guy. "The complexity of depth-3 circuits computing symmetric Boolean functions." Information Processing Letters 100, no. 2 (October 2006): 41–46. http://dx.doi.org/10.1016/j.ipl.2006.06.008.
Повний текст джерелаAgrawal, Manindra, Chandan Saha, Ramprasad Saptharishi, and Nitin Saxena. "Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits." SIAM Journal on Computing 45, no. 4 (January 2016): 1533–62. http://dx.doi.org/10.1137/130910725.
Повний текст джерелаAlbrecht, A., E. Hein, D. Melzer, K. Steinhöfel, M. Taupitz, and C. K. Wong. "Liver tissue classification by bounded-depth threshold circuits." International Congress Series 1230 (June 2001): 1156–57. http://dx.doi.org/10.1016/s0531-5131(01)00202-3.
Повний текст джерелаFagin, Ronald, Maria M. Klawe, Nicholas J. Pippenger, and Larry Stockmeyer. "Bounded-depth, polynomial-size circuits for symmetric functions." Theoretical Computer Science 36 (1985): 239–50. http://dx.doi.org/10.1016/0304-3975(85)90045-3.
Повний текст джерелаGreen, F., S. Homer, C. Moore, and C. Pollett. "Counting, fanout and the complexity of quantum ACC." Quantum Information and Computation 2, no. 1 (January 2002): 35–65. http://dx.doi.org/10.26421/qic2.1-3.
Повний текст джерелаBrustmann, Bettina, and Ingo Wegener. "The complexity of symmetric functions in bounded-depth circuits." Information Processing Letters 25, no. 4 (June 1987): 217–19. http://dx.doi.org/10.1016/0020-0190(87)90163-3.
Повний текст джерелаGrolmusz, Vince. "A lower bound for depth-3 circuits with MOD m gates." Information Processing Letters 67, no. 2 (July 1998): 87–90. http://dx.doi.org/10.1016/s0020-0190(98)00093-3.
Повний текст джерелаSergeev, Igor' S. "On the complexity of bounded-depth circuits and formulas over the basis of fan-in gates." Discrete Mathematics and Applications 29, no. 4 (August 27, 2019): 241–54. http://dx.doi.org/10.1515/dma-2019-0022.
Повний текст джерелаAllender, Eric, V. Arvind, Rahul Santhanam, and Fengming Wang. "Uniform derandomization from pathetic lower bounds." Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences 370, no. 1971 (July 28, 2012): 3512–35. http://dx.doi.org/10.1098/rsta.2011.0318.
Повний текст джерелаLai, Wenxing. "The Inapproximability of k-DominatingSet for Parameterized AC 0 Circuits †." Algorithms 12, no. 11 (November 4, 2019): 230. http://dx.doi.org/10.3390/a12110230.
Повний текст джерелаKulikov, Alexander S., and Vladimir V. Podolskii. "Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates." Theory of Computing Systems 63, no. 5 (November 29, 2018): 956–86. http://dx.doi.org/10.1007/s00224-018-9900-3.
Повний текст джерелаCai, Jin-yi. "Lower bounds for constant-depth circuits in the presence of help bits." Information Processing Letters 36, no. 2 (October 1990): 79–83. http://dx.doi.org/10.1016/0020-0190(90)90101-3.
Повний текст джерелаDvir, Zeev, and Amir Shpilka. "Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits." SIAM Journal on Computing 36, no. 5 (January 2007): 1404–34. http://dx.doi.org/10.1137/05063605x.
Повний текст джерелаJukna, Stasys. "Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates." Information Processing Letters 56, no. 3 (November 1995): 147–50. http://dx.doi.org/10.1016/0020-0190(95)00137-2.
Повний текст джерелаSaxena, Nitin, and C. Seshadhri. "Blackbox Identity Testing for Bounded Top-Fanin Depth-3 Circuits: The Field Doesn't Matter." SIAM Journal on Computing 41, no. 5 (January 2012): 1285–98. http://dx.doi.org/10.1137/10848232.
Повний текст джерелаNi, Xiaotong, and Maarten van den Nest. "Commuting quantum circuits: efficiently classical simulations versus hardness results." Quantum Information and Computation 13, no. 1&2 (January 2013): 54–72. http://dx.doi.org/10.26421/qic13.1-2-5.
Повний текст джерелаGrigoriev, D., and A. Razborov. "Exponential Lower Bounds for Depth 3 Arithmetic Circuits in Algebras of Functions over Finite Fields." Applicable Algebra in Engineering, Communication and Computing 10, no. 6 (July 1, 2000): 465–87. http://dx.doi.org/10.1007/s002009900021.
Повний текст джерелаUchizawa, Kei, Rodney Douglas, and Wolfgang Maass. "On the Computational Power of Threshold Circuits with Sparse Activity." Neural Computation 18, no. 12 (December 2006): 2994–3008. http://dx.doi.org/10.1162/neco.2006.18.12.2994.
Повний текст джерелаDövencioğlu, Dicle, Hiroshi Ban, Andrew J. Schofield, and Andrew E. Welchman. "Perceptual Integration for Qualitatively Different 3-D Cues in the Human Brain." Journal of Cognitive Neuroscience 25, no. 9 (September 2013): 1527–41. http://dx.doi.org/10.1162/jocn_a_00417.
Повний текст джерелаKarnin, Zohar S., and Amir Shpilka. "Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in." Combinatorica 31, no. 3 (May 2011): 333–64. http://dx.doi.org/10.1007/s00493-011-2537-3.
Повний текст джерелаBun, Mark, Robin Kothari, and Justin Thaler. "Quantum algorithms and approximating polynomials for composed functions with shared inputs." Quantum 5 (September 16, 2021): 543. http://dx.doi.org/10.22331/q-2021-09-16-543.
Повний текст джерелаAmin, Kazi Rafsanjani, Carine Ladner, Guillaume Jourdan, Sébastien Hentz, Nicolas Roch, and Julien Renard. "Loss mechanisms in TiN high impedance superconducting microwave circuits." Applied Physics Letters 120, no. 16 (April 18, 2022): 164001. http://dx.doi.org/10.1063/5.0086019.
Повний текст джерелаRomano, A., J. Vanhellemont, A. De Keersgieter, W. Vandervorst, J. R. Morante, and J. Van Landuyt. "A novel TEM technique for junction delineation in integrated circuits." Proceedings, annual meeting, Electron Microscopy Society of America 48, no. 4 (August 1990): 748–49. http://dx.doi.org/10.1017/s0424820100176873.
Повний текст джерелаYetiş, Hasan, and Mehmet Karaköse. "A New Framework Containing Convolution and Pooling Circuits for Image Processing and Deep Learning Applications with Quantum Computing Implementation." Traitement du Signal 39, no. 2 (April 30, 2022): 501–12. http://dx.doi.org/10.18280/ts.390212.
Повний текст джерелаAsadpour, Ailin, Amir Sabbagh Molahosseini, and Azadeh Alsadat Emrani Zarandi. "The use of reversible logic gates in the design of residue number systems." International Journal of Electrical and Computer Engineering (IJECE) 13, no. 2 (April 1, 2023): 2009. http://dx.doi.org/10.11591/ijece.v13i2.pp2009-2022.
Повний текст джерелаKim and Choi. "Indirect Time-of-Flight Depth Sensor with Two-Step Comparison Scheme for Depth Frame Difference Detection." Sensors 19, no. 17 (August 23, 2019): 3674. http://dx.doi.org/10.3390/s19173674.
Повний текст джерела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.
Повний текст джерелаEmelyanov, V. V. "Passivation of a Conductive System of Integrated Circuits with a Layer of Aluminum Nitride." Doklady BGUIR 21, no. 3 (June 20, 2023): 12–16. http://dx.doi.org/10.35596/1729-7648-2023-21-3-12-16.
Повний текст джерелаYin, Yue-Xin, Xiao-Jie Yin, Xiao-Pei Zhang, Guan-Wen Yan, Yue Wang, Yuan-Da Wu, Jun-Ming An, Liang-Liang Wang, and Da-Ming Zhang. "High-Q-Factor Silica-Based Racetrack Microring Resonators." Photonics 8, no. 2 (February 6, 2021): 43. http://dx.doi.org/10.3390/photonics8020043.
Повний текст джерелаAslantas, Kubilay, Şükrü Ülker, Ömer Şahan, Danil Yu Pimenov, and Khaled Giasin. "Mechanistic modeling of cutting forces in high-speed microturning of titanium alloy with consideration of nose radius." International Journal of Advanced Manufacturing Technology 119, no. 3-4 (December 10, 2021): 2393–408. http://dx.doi.org/10.1007/s00170-021-08437-w.
Повний текст джерелаSimko, Steven J., and Richard A. Waldo. "Multitechnique problem solving using EDS/EPMA and surface analysis." Proceedings, annual meeting, Electron Microscopy Society of America 50, no. 2 (August 1992): 1782–83. http://dx.doi.org/10.1017/s0424820100133540.
Повний текст джерелаWeisse, Julietta, Heinz Mitlehner, Lothar Frey, and Tobias Erlbacher. "Design of a 4H-SiC RESURF n-LDMOS Transistor for High Voltage Integrated Circuits." Materials Science Forum 963 (July 2019): 629–32. http://dx.doi.org/10.4028/www.scientific.net/msf.963.629.
Повний текст джерела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.
Повний текст джерелаTheys, Tom, Pierpaolo Pani, Johannes van Loon, Jan Goffin, and Peter Janssen. "Three-dimensional Shape Coding in Grasping Circuits: A Comparison between the Anterior Intraparietal Area and Ventral Premotor Area F5a." Journal of Cognitive Neuroscience 25, no. 3 (March 2013): 352–64. http://dx.doi.org/10.1162/jocn_a_00332.
Повний текст джерелаKim, Dongyung. "An Optimized Discrete Data Classification Method in N -Dimensional." Computational and Mathematical Methods 2022 (May 28, 2022): 1–8. http://dx.doi.org/10.1155/2022/8199872.
Повний текст джерела