Depth-3 circuits for inner product
type: Item
instance of: scholarly article
title: Depth-3 circuits for inner product
author: Mika Göös
author: Ziyi Guan
author: Tiberiu Mosnoi
published in: Information and Computation
publication date: 2024-10-08T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7922682
zbMATH Keywords: circuit complexity
zbMATH Keywords: inner product
MaRDI profile type: Publication
cites work: 34th international symposium on algorithms and computation (ISAAC 2023), Kyoto, Japan, December 3--6, 2023
cites work: Q6126311
cites work: Top-down lower bounds for depth-three circuits
cites work: Which problems have strongly exponential complexity?
cites work: Boolean function complexity. Advances and frontiers.
cites work: Fractional Covers and Communication Complexity
cites work: Communication Complexity
cites work: Lower Bounds in Communication Complexity
cites work: On the ratio of optimal integral and fractional covers
cites work: Exponential lower bounds for depth three Boolean circuits
cites work: An improved exponential-time algorithm for k -SAT
cites work: Q4484662
cites work: Q4164821
cites work: On the Power of Small-Depth Computation
DOI: 10.1016/J.IC.2024.105192
description: scientific article; zbMATH DE number 7922682