Closure under factorization from a result of Furstenberg

Documenti analoghi

• Constant-depth circuits for polynomial GCD over any characteristic
  di: Bhattacharjee, Somnath, et al.
  Pubblicazione: (2025)
• Deterministic factorization of constant-depth algebraic circuits in subexponential time
  di: Bhattacharjee, Somnath, et al.
  Pubblicazione: (2025)
• Towards Deterministic Algorithms for Constant-Depth Factors of Constant-Depth Circuits
  di: Kumar, Mrinal, et al.
  Pubblicazione: (2024)
• Modular composition & polynomial GCD in the border of small, shallow circuits
  di: Andrews, Robert, et al.
  Pubblicazione: (2025)
• If VNP is hard, then so are equations for it
  di: Kumar, Mrinal, et al.
  Pubblicazione: (2020)