scientific article
From MaRDI portal
Publication:2830870
DOI10.4086/toc.2016.v012a012zbMath1393.68063OpenAlexW2610787866MaRDI QIDQ2830870
Srikanth Srinivasan, Nutan Limaye, Guillaume Malod
Publication date: 1 November 2016
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2016.v012a012
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
polynomialslower boundscircuitscircuit complexityalgebraic complexitycomplexity theoryarithmetic circuitsnoncommutative ringskew circuits
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Unnamed Item ⋮ Unnamed Item ⋮ Lower bounds for arithmetic circuits via the Hankel matrix ⋮ On Hard Instances of Non-Commutative Permanent ⋮ Operator scaling: theory and applications ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
Cites Work
This page was built for publication:
