Depth-3 circuits for inner product
From MaRDI portal
Publication:6614883
DOI10.1016/J.IC.2024.105192MaRDI QIDQ6614883
Ziyi Guan, Tiberiu Mosnoi, Mika Göös
Publication date: 8 October 2024
Published in: Information and Computation (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Boolean function complexity. Advances and frontiers.
- On the ratio of optimal integral and fractional covers
- Exponential lower bounds for depth three Boolean circuits
- Which problems have strongly exponential complexity?
- Top-down lower bounds for depth-three circuits
- On the Power of Small-Depth Computation
- Lower Bounds in Communication Complexity
- An improved exponential-time algorithm for k -SAT
- Fractional Covers and Communication Complexity
- Communication Complexity
- 34th international symposium on algorithms and computation (ISAAC 2023), Kyoto, Japan, December 3--6, 2023
This page was built for publication: Depth-3 circuits for inner product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6614883)
