On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-In

ISSN： 0022-0000

Source： Journal of Computer and System Sciences, Vol.54, Iss.1, 1997-02, pp. : 199-212

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Reversible modified reconstructability analysis of Boolean circuits and its quantum computation

By Al-Rabadi Anas N Zwick Martin

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 33, Iss. 5-6, 2004-05 ,pp. : 921-932

Emerald Group Publishing Ltd

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

Can large fanin circuits perform reliable computations in the presence of faults?

By Reischuk R.

Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. : 319-335

Elsevier

Access to resources Recommend Favorite

Boolean representation of bounded BCK-algebras

By Gispert Joan

Soft Computing, Vol. 12, Iss. 10, 2008-08 ,pp. : 941-954

Springer Publishing Company

Access to resources Recommend Favorite

Non-cancellative Boolean circuits: A generalization of monotone boolean circuits

By Sengupta R. Venkateswaran H.

Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. : 197-212

Elsevier

Access to resources Recommend Favorite