Ghosal, Purnata; Rao, B. V. Raghavendra Limitations of sums of bounded read formulas and ABPs. (English) Zbl 07493529 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 147-169 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{P. Ghosal} and \textit{B. V. R. Rao}, Lect. Notes Comput. Sci. 12730, 147--169 (2021; Zbl 07493529) Full Text: DOI arXiv OpenURL
Forbes, Michael A.; Shpilka, Amir; Tzameret, Iddo; Wigderson, Avi Proof complexity lower bounds from algebraic circuit complexity. (English) Zbl 07471587 Theory Comput. 17, Paper No. 10, 88 p. (2021). MSC: 68Q17 68Q15 03F20 PDF BibTeX XML Cite \textit{M. A. Forbes} et al., Theory Comput. 17, Paper No. 10, 88 p. (2021; Zbl 07471587) Full Text: DOI OpenURL
Ghosal, Purnata; Raghavendra, Rao B. V. On proving parameterized size lower bounds for multilinear algebraic models. (English) Zbl 07350025 Fundam. Inform. 177, No. 1, 69-93 (2020). MSC: 68-XX PDF BibTeX XML Cite \textit{P. Ghosal} and \textit{R. B. V. Raghavendra}, Fundam. Inform. 177, No. 1, 69--93 (2020; Zbl 07350025) Full Text: DOI OpenURL
Alon, Noga; Kumar, Mrinal; Volk, Ben Lee Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits. (English) Zbl 07254822 Combinatorica 40, No. 2, 149-178 (2020). MSC: 68Q06 05D05 68Q17 PDF BibTeX XML Cite \textit{N. Alon} et al., Combinatorica 40, No. 2, 149--178 (2020; Zbl 07254822) Full Text: DOI Link OpenURL
Chillara, Suryajith Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree. (English) Zbl 1478.68097 Inf. Process. Lett. 156, Article ID 105900, 5 p. (2020). MSC: 68Q17 68Q06 68Q25 PDF BibTeX XML Cite \textit{S. Chillara}, Inf. Process. Lett. 156, Article ID 105900, 5 p. (2020; Zbl 1478.68097) Full Text: DOI OpenURL
Ramya, C.; Raghavendra Rao, B. V. Lower bounds for special cases of syntactic multilinear ABPs. (English) Zbl 1436.68129 Theor. Comput. Sci. 809, 1-20 (2020). MSC: 68Q17 PDF BibTeX XML Cite \textit{C. Ramya} and \textit{B. V. Raghavendra Rao}, Theor. Comput. Sci. 809, 1--20 (2020; Zbl 1436.68129) Full Text: DOI OpenURL
Chillara, Suryajith; Limaye, Nutan; Srinivasan, Srikanth Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications. (English) Zbl 1412.68069 SIAM J. Comput. 48, No. 1, 70-92 (2019). MSC: 68Q17 15A99 68Q25 PDF BibTeX XML Cite \textit{S. Chillara} et al., SIAM J. Comput. 48, No. 1, 70--92 (2019; Zbl 1412.68069) Full Text: DOI OpenURL
Forbes, Michael A.; Shpilka, Amir; Volk, Ben Lee Succinct hitting sets and barriers to proving lower bounds for algebraic circuits. (English) Zbl 1412.68081 Theory Comput. 14, Paper No. 18, 45 p. (2018). MSC: 68Q25 68Q17 68W20 PDF BibTeX XML Cite \textit{M. A. Forbes} et al., Theory Comput. 14, Paper No. 18, 45 p. (2018; Zbl 1412.68081) Full Text: DOI OpenURL
Mahajan, Meena; Tawari, Anuj Sums of read-once formulas: how many summands are necessary? (English) Zbl 1382.68342 Theor. Comput. Sci. 708, 34-45 (2018). MSC: 68W30 12Y05 68Q17 PDF BibTeX XML Cite \textit{M. Mahajan} and \textit{A. Tawari}, Theor. Comput. Sci. 708, 34--45 (2018; Zbl 1382.68342) Full Text: DOI OpenURL
Arvind, V.; Raja, S. Some lower bound results for set-multilinear arithmetic computations. (English) Zbl 1358.68109 Chic. J. Theor. Comput. Sci. 2016, Article No. 6, 26 p. (2016). MSC: 68Q17 15A15 68W30 94C10 PDF BibTeX XML Cite \textit{V. Arvind} and \textit{S. Raja}, Chic. J. Theor. Comput. Sci. 2016, Article No. 6, 26 p. (2016; Zbl 1358.68109) Full Text: DOI arXiv OpenURL
Fournier, Hervé; Limaye, Nutan; Malod, Guillaume; Srinivasan, Srikanth Lower bounds for depth-4 formulas computing iterated matrix multiplication. (English) Zbl 1330.68093 SIAM J. Comput. 44, No. 5, 1173-1201 (2015). MSC: 68Q17 68Q25 68W30 PDF BibTeX XML Cite \textit{H. Fournier} et al., SIAM J. Comput. 44, No. 5, 1173--1201 (2015; Zbl 1330.68093) Full Text: DOI OpenURL
Hrubeš, Pavel; Tzameret, Iddo Short proofs for the determinant identities. (English) Zbl 06442174 SIAM J. Comput. 44, No. 2, 340-383 (2015). MSC: 03F20 03B05 03D15 68Q15 68Q17 68W30 PDF BibTeX XML Cite \textit{P. Hrubeš} and \textit{I. Tzameret}, SIAM J. Comput. 44, No. 2, 340--383 (2015; Zbl 06442174) Full Text: DOI arXiv OpenURL
Mahajan, Meena Algebraic complexity classes. (English) Zbl 1345.68145 Agrawal, Manindra (ed.) et al., Perspectives in computational complexity. The Somenath Biswas anniversary volume. Selected papers based on the presentations at the workshop, Kanpur, India, Summer 2012. Cham: Birkhäuser/Springer (ISBN 978-3-319-05445-2/hbk; 978-3-319-05446-9/ebook). Progress in Computer Science and Applied Logic 26, 51-75 (2014). MSC: 68Q15 PDF BibTeX XML Cite \textit{M. Mahajan}, Prog. Comput. Sci. Appl. Log. 26, 51--75 (2014; Zbl 1345.68145) Full Text: DOI arXiv OpenURL
Jansen, Maurice; Mahajan, Meena; Raghavendra Rao, B. V. Resource trade-offs in syntactically multilinear arithmetic circuits. (English) Zbl 1286.68135 Comput. Complexity 22, No. 3, 517-564 (2013). MSC: 68Q05 03D15 68Q15 PDF BibTeX XML Cite \textit{M. Jansen} et al., Comput. Complexity 22, No. 3, 517--564 (2013; Zbl 1286.68135) Full Text: DOI Link OpenURL
Koiran, Pascal Arithmetic circuits: the chasm at depth four gets wider. (English) Zbl 1253.68139 Theor. Comput. Sci. 448, 56-65 (2012). MSC: 68Q15 68Q17 68W30 PDF BibTeX XML Cite \textit{P. Koiran}, Theor. Comput. Sci. 448, 56--65 (2012; Zbl 1253.68139) Full Text: DOI OpenURL
Raz, Ran; Yehudayoff, Amir Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors. (English) Zbl 1209.68382 J. Comput. Syst. Sci. 77, No. 1, 167-190 (2011). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{R. Raz} and \textit{A. Yehudayoff}, J. Comput. Syst. Sci. 77, No. 1, 167--190 (2011; Zbl 1209.68382) Full Text: DOI Link OpenURL