Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with Multiple Product:
TR95-017 | 27th March 1995
Claudia Bertram, Thomas Hofmeister

Multiple Product Modulo Arbitrary Numbers

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

more >>>

TR97-034 | 3rd September 1997
Jui-Lin Lee

Counting in uniform $TC^0$

In this paper we first give a uniform $AC^0$ algorithm which uses
partial sums to compute multiple addition. Then we use it to show
that multiple addition is computable in uniform $TC^0$ by using
$count$ only once sequentially. By constructing bit matrix for
multiple addition, ... more >>>

ISSN 1433-8092 | Imprint