Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR95-017 | 27th March 1995 00:00

Multiple Product Modulo Arbitrary Numbers

RSS-Feed




TR95-017
Authors: Claudia Bertram, Thomas Hofmeister
Publication: 6th April 1995 10:45
Downloads: 945
Keywords: 


Abstract:

We consider the threshold circuit complexity of computing
the multiple product modulo m in threshold circuits.



ISSN 1433-8092 | Imprint