scientific article
From MaRDI portal
Publication:3002772
DOI10.4086/toc.2006.v002a010zbMath1213.68341OpenAlexW2148132824MaRDI QIDQ3002772
Publication date: 24 May 2011
Published in: Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/toc.2006.v002a010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (6)
Complexity of Equivalence and Learning for Multiplicity Tree Automata ⋮ Deterministic polynomial identity tests for multilinear bounded-read formulae ⋮ Unnamed Item ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits ⋮ An Algebraic Perspective on Boolean Function Learning
This page was built for publication:
