Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR15-145 | 5th September 2015 13:06

Arithmetic circuit classes over Zm

RSS-Feed




TR15-145
Authors: Eric Allender, Asa Goodwillie
Publication: 5th September 2015 13:06
Downloads: 796
Keywords: 


Abstract:

We continue the study of the complexity classes VP(Zm) and LambdaP(Zm) which was initiated in [AGM15]. We distinguish between “strict” and “lax” versions of these classes and prove some new equalities and inclusions between these arithmetic circuit classes and various subclasses of ACC^1.



ISSN 1433-8092 | Imprint