References in zbMATH (referenced in 23 articles )

Showing results 1 to 20 of 23.
Sorted by year (citations)

1 2 next

  1. Cseresnyes, Ehud; Seiwert, Hannes: Regular expression length via arithmetic formula complexity (2022)
  2. Bisht, Pranav; Saxena, Nitin: Blackbox identity testing for sum of special ROABPs and its border class (2021)
  3. Dutta, Pranjal: Real (\tau)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (2021)
  4. Ghosal, Purnata; Rao, B. V. Raghavendra: Limitations of sums of bounded read formulas and ABPs (2021)
  5. Sinhababu, Amit; Thierauf, Thomas: Factorization of polynomials given by arithmetic branching programs (2021)
  6. Chillara, Suryajith: Slightly improved lower bounds for homogeneous formulas of bounded depth and bounded individual degree (2020)
  7. Dörfler, Julian; Ikenmeyer, Christian; Panova, Greta: On geometric complexity theory: multiplicity obstructions are stronger than occurrence obstructions (2020)
  8. Ghosal, Purnata; Raghavendra, Rao B. V.: On proving parameterized size lower bounds for multilinear algebraic models (2020)
  9. Ramya, C.; Raghavendra Rao, B. V.: Lower bounds for special cases of syntactic multilinear ABPs (2020)
  10. Chillara, Suryajith; Limaye, Nutan; Srinivasan, Srikanth: Small-depth multilinear formula lower bounds for iterated matrix multiplication with applications (2019)
  11. Chillara, Suryajith; Mukhopadhyay, Partha: Depth-4 lower bounds, determinantal complexity: a unified approach (2019)
  12. Kumar, Mrinal: A quadratic lower bound for homogeneous algebraic branching programs (2019)
  13. Kumar, Mrinal; Saptharishi, Ramprasad: The computational power of depth five arithmetic circuits (2019)
  14. Alon, Noga; Kumar, Mrinal; Volk, Ben Lee: Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (2018)
  15. Chillara, Suryajith; Limaye, Nutan; Srinivasan, Srikanth: Small-depth multilinear formula lower bounds for Iterated Matrix Multiplication, with applications (2018)
  16. Chillara, Suryajith; Limaye, Nutan; Srinivasan, Srikanth: A quadratic size-hierarchy theorem for small-depth multilinear formulas (2018)
  17. Chou, Chi-Ning; Kumar, Mrinal; Solomon, Noam: Hardness vs randomness for bounded depth arithmetic circuits (2018)
  18. Christandl, Matthias; Jensen, Asger Kjærulff; Zuiddam, Jeroen: Tensor rank is not multiplicative under the tensor product (2018)
  19. Forbes, Michael A.; Ghosh, Sumanta; Saxena, Nitin: Towards blackbox identity testing of log-variate circuits (2018)
  20. Koiran, Pascal; Pecatte, Timothée; García-Marco, Ignacio: On the linear independence of shifted powers (2018)

1 2 next