On the power of circuits with gates of low L 1 norms

By Grolmusz V.  

Theoretical Computer Science, Vol. 188, Iss. 1, 1997-11 ,pp. : 117-128

Elsevier

Access to resources Recommend Favorite

On the VC-dimension of depth four threshold circuits and the complexity of Boolean-valued functions

By Sakurai A.  

Theoretical Computer Science, Vol. 137, Iss. 1, 1995-01 ,pp. : 109-127

Elsevier

Access to resources Recommend Favorite

Circuits and Expressions with Nonassociative Gates

By Moore C.   Thérien D.   Lemieux F.   Berman J.   Drisko A.  

Journal of Computer and System Sciences, Vol. 60, Iss. 2, 2000-04 ,pp. : 368-394

Academic Press

Access to resources Recommend Favorite

On the Role of Hadamard Gates in Quantum Circuits

By Shepherd D.  

Quantum Information Processing, Vol. 5, Iss. 3, 2006-06 ,pp. : 161-177

Springer Publishing Company

Access to resources Recommend Favorite

Computational indistinguishability: algorithms vs. circuits

By Goldreich O.   Meyer B.  

Theoretical Computer Science, Vol. 191, Iss. 1, 1998-01 ,pp. : 215-218

Elsevier

Access to resources Recommend Favorite