Document is current

Any future updates will be listed below

Lower Bounds and PIT for Non-commutative Arithmetic Circuits with Restricted Parse Trees

Crossref DOI link: https://doi.org/10.1007/s00037-018-0171-9

Published Online: 2018-09-29

Published Print: 2019-09

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark