scientific article; zbMATH DE number 7140484
From MaRDI portal
Publication:5204825
DOI10.4086/toc.2019.v015a007zbMath1477.68531OpenAlexW2626372708MaRDI QIDQ5204825
No author found.
Publication date: 5 December 2019
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2019.v015a007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
randomized algorithmalgebraic complexitypolynomial identity testingnon-commutative computationpolynomial indentity lemma
Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Randomized algorithms (68W20) Networks and circuits as models of computation; circuit complexity (68Q06)
Related Items (3)
Schur polynomials do not have small formulas if the determinant does not ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication:
