Literatura académica sobre el tema "Multilinear Depth 3 Circuits"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Multilinear Depth 3 Circuits".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Multilinear Depth 3 Circuits"
Ghosal, Purnata y B. V. Raghavendra Rao. "On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models". Fundamenta Informaticae 177, n.º 1 (18 de diciembre de 2020): 69–93. http://dx.doi.org/10.3233/fi-2020-1980.
Texto completoSaraf, Shubhangi y Ilya Volkovich. "Black-Box Identity Testing of Depth-4 Multilinear Circuits". Combinatorica 38, n.º 5 (9 de diciembre de 2017): 1205–38. http://dx.doi.org/10.1007/s00493-016-3460-4.
Texto completoRaz, Ran y Amir Yehudayoff. "Lower Bounds and Separations for Constant Depth Multilinear Circuits". computational complexity 18, n.º 2 (junio de 2009): 171–207. http://dx.doi.org/10.1007/s00037-009-0270-8.
Texto completoChillara, Suryajith. "On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits". ACM Transactions on Computation Theory 13, n.º 3 (30 de septiembre de 2021): 1–21. http://dx.doi.org/10.1145/3460952.
Texto completoKarnin, Zohar S., Partha Mukhopadhyay, Amir Shpilka y Ilya Volkovich. "Deterministic Identity Testing of Depth-4 Multilinear Circuits with Bounded Top Fan-in". SIAM Journal on Computing 42, n.º 6 (enero de 2013): 2114–31. http://dx.doi.org/10.1137/110824516.
Texto completoKayal, Neeraj, Vineet Nair y Chandan Saha. "Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth-three Circuits". ACM Transactions on Computation Theory 12, n.º 1 (25 de febrero de 2020): 1–27. http://dx.doi.org/10.1145/3369928.
Texto completoGupta, Ankit, Pritish Kamath, Neeraj Kayal y Ramprasad Saptharishi. "Arithmetic Circuits: A Chasm at Depth 3". SIAM Journal on Computing 45, n.º 3 (enero de 2016): 1064–79. http://dx.doi.org/10.1137/140957123.
Texto completoKayal, Neeraj y Nitin Saxena. "Polynomial Identity Testing for Depth 3 Circuits". computational complexity 16, n.º 2 (mayo de 2007): 115–38. http://dx.doi.org/10.1007/s00037-007-0226-9.
Texto completoFang, M., S. Fenner, F. Green, S. Homer y Y. Zhang. "Quantum lower bounds for fanout". Quantum Information and Computation 6, n.º 1 (enero de 2006): 46–57. http://dx.doi.org/10.26421/qic6.1-3.
Texto completoLovett, Shachar y Emanuele Viola. "Bounded-Depth Circuits Cannot Sample Good Codes". computational complexity 21, n.º 2 (30 de marzo de 2012): 245–66. http://dx.doi.org/10.1007/s00037-012-0039-3.
Texto completoTesis sobre el tema "Multilinear Depth 3 Circuits"
Nair, Vineet. "Expanders in Arithmetic Circuit Lower Bound : Towards a Separation Between ROABPs and Multilinear Depth 3 Circuits". Thesis, 2015. https://etd.iisc.ac.in/handle/2005/4811.
Texto completoCapítulos de libros sobre el tema "Multilinear Depth 3 Circuits"
Goldreich, Oded y Avishay Tal. "On Constant-Depth Canonical Boolean Circuits for Computing Multilinear Functions". En Lecture Notes in Computer Science, 306–25. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43662-9_17.
Texto completoGoldreich, Oded y Avi Wigderson. "On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions". En Lecture Notes in Computer Science, 41–86. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-43662-9_6.
Texto completoBhargava, Vishwas, Shubhangi Saraf y Ilya Volkovich. "Reconstruction of Depth-4 Multilinear Circuits". En Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2144–60. Philadelphia, PA: Society for Industrial and Applied Mathematics, 2020. http://dx.doi.org/10.1137/1.9781611975994.132.
Texto completoJukna, Stasys. "Depth-3 Circuits". En Algorithms and Combinatorics, 303–38. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24508-4_11.
Texto completoJukna, Stasys. "Large-Depth Circuits". En Algorithms and Combinatorics, 339–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-24508-4_12.
Texto completoRazborov, Alexander A. "On small depth threshold circuits". En Algorithm Theory — SWAT '92, 42–52. Berlin, Heidelberg: Springer Berlin Heidelberg, 1992. http://dx.doi.org/10.1007/3-540-55706-7_4.
Texto completoGarg, Sanjam, Craig Gentry, Shai Halevi, Amit Sahai y Brent Waters. "Attribute-Based Encryption for Circuits from Multilinear Maps". En Advances in Cryptology – CRYPTO 2013, 479–99. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-40084-1_27.
Texto completoTang, Fei, Hongda Li y Bei Liang. "Attribute-Based Signatures for Circuits from Multilinear Maps". En Lecture Notes in Computer Science, 54–71. Cham: Springer International Publishing, 2014. http://dx.doi.org/10.1007/978-3-319-13257-0_4.
Texto completoLingas, Andrzej. "Lower Bounds for Monotone q-Multilinear Boolean Circuits". En Lecture Notes in Computer Science, 301–12. Cham: Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-23101-8_20.
Texto completoKlivans, Adam R. "On the Derandomization of Constant Depth Circuits". En Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 249–60. Berlin, Heidelberg: Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44666-4_28.
Texto completoActas de conferencias sobre el tema "Multilinear Depth 3 Circuits"
Bhargava, Vishwas, Shubhangi Saraf y Ilya Volkovich. "Reconstruction algorithms for low-rank tensors and depth-3 multilinear circuits". En STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing. New York, NY, USA: ACM, 2021. http://dx.doi.org/10.1145/3406325.3451096.
Texto completoChillara, Suryajith, Christian Engels, Nutan Limaye y Srikanth Srinivasan. "A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits". En 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2018. http://dx.doi.org/10.1109/focs.2018.00092.
Texto completoSaraf, Shubhangi y Ilya Volkovich. "Black-box identity testing of depth-4 multilinear circuits". En the 43rd annual ACM symposium. New York, New York, USA: ACM Press, 2011. http://dx.doi.org/10.1145/1993636.1993693.
Texto completoRaz, Ran y Amir Yehudayoff. "Lower Bounds and Separations for Constant Depth Multilinear Circuits". En 2008 23rd Annual IEEE Conference on Computational Complexity. IEEE, 2008. http://dx.doi.org/10.1109/ccc.2008.8.
Texto completoGupta, Ankit, Neeraj Kayal y Satya Lokam. "Reconstruction of depth-4 multilinear circuits with top fan-in 2". En the 44th symposium. New York, New York, USA: ACM Press, 2012. http://dx.doi.org/10.1145/2213977.2214035.
Texto completoKarnin, Zohar S., Partha Mukhopadhyay, Amir Shpilka y Ilya Volkovich. "Deterministic identity testing of depth-4 multilinear circuits with bounded top fan-in". En the 42nd ACM symposium. New York, New York, USA: ACM Press, 2010. http://dx.doi.org/10.1145/1806689.1806779.
Texto completoPaturi, Ramamohan, Michael E. Saks y Francis Zane. "Exponential lower bounds for depth 3 Boolean circuits". En the twenty-ninth annual ACM symposium. New York, New York, USA: ACM Press, 1997. http://dx.doi.org/10.1145/258533.258556.
Texto completoKayal, Neeraj y Shubhangi Saraf. "Blackbox Polynomial Identity Testing for Depth 3 Circuits". En 2009 IEEE 50th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2009. http://dx.doi.org/10.1109/focs.2009.67.
Texto completoDutta, Pranjal, Prateek Dwivedi y Nitin Saxena. "Demystifying the border of depth-3 algebraic circuits". En 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, 2022. http://dx.doi.org/10.1109/focs52979.2021.00018.
Texto completoGrigoriev, Dima y Marek Karpinski. "An exponential lower bound for depth 3 arithmetic circuits". En the thirtieth annual ACM symposium. New York, New York, USA: ACM Press, 1998. http://dx.doi.org/10.1145/276698.276872.
Texto completo