The Complexity of Bounded Register and Skew Arithmetic Computation
From MaRDI portal
Publication:2920493
DOI10.1007/978-3-319-08783-2_49zbMath1354.68104OpenAlexW210031696MaRDI QIDQ2920493
No author found.
Publication date: 26 September 2014
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-08783-2_49
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Unnamed Item ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees
This page was built for publication: The Complexity of Bounded Register and Skew Arithmetic Computation
