scientific article; zbMATH DE number 6789567

DOI10.4086/toc.2017.v013a009zbMath1379.68149OpenAlexW3037187402MaRDI QIDQ5368898

Nutan Limaye, Srikanth Srinivasan, Meena Mahajan, Hervé Fournier

Publication date: 11 October 2017

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2017.v013a009

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

arithmetic circuitsinclusion matricesdepth-4 circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Schur polynomials do not have small formulas if the determinant does not ⋮ Unnamed Item

This page was built for publication: