scientific article; zbMATH DE number 7104452
From MaRDI portal
Publication:5232538
DOI10.4086/cjtcs.2019.002zbMath1422.68070OpenAlexW4246461438MaRDI QIDQ5232538
Guillaume Lagarde, Sylvain Perifel, Guillaume Malod
Publication date: 12 September 2019
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2019.002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Lower bounds for arithmetic circuits via the Hankel matrix ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
Cites Work
- New results on noncommutative and commutative polynomial identity testing
- Matrices de Hankel
- A probabilistic remark on algebraic program testing
- Deterministic polynomial identity testing in non-commutative models
- Lower bounds for arithmetic circuits via the Hankel matrix
- Characterizing Valiant's algebraic complexity classes
- Realizations by stochastic finite automata
- Arithmetic Circuits: A survey of recent results and open questions
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Multi-linear formulas for permanent and determinant are of super-polynomial size
- Clifford algebras and approximating the permanent
This page was built for publication:
