"AC0[p]-Frege Cannot Efficiently Prove that Constant-Depth ..."

Jiaqi Lu, Rahul Santhanam, Iddo Tzameret (2025)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2026-06-10

- view
  - electronic edition @ weizmann.ac.il (open access)
- export record
  dblp key:
  - journals/eccc/LuST25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/LuST25
Jiaqi Lu, Rahul Santhanam, Iddo Tzameret:
AC⁰[p]-Frege Cannot Efficiently Prove that Constant-Depth Algebraic Circuit Lower Bounds are Hard. Electron. Colloquium Comput. Complex. TR25: Article TR25-134 (2025)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.