Unrestricted vs restricted cut in a tableau method for Boolean circuits

ISSN： 1012-2443

Source： Annals of Mathematics and Artificial Intelligence, Vol.44, Iss.4, 2005-08, pp. : 373-399

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

Tableau method for residuated logic

By MacCaull W.

Fuzzy Sets and Systems, Vol. 80, Iss. 3, 1996-06 ,pp. : 327-337

Elsevier

Access to resources Recommend Favorite

A historical teaching module on ‘the unreasonable effectiveness of mathematics’: Boolean algebra and Shannon circuits

By Jankvist Uffe Thomas

BSHM Bulletin: Journal of the British Society for the History of Mathematics, Vol. 29, Iss. 2, 2014-05 ,pp. : 120-133

Taylor & Francis Ltd

Access to resources Recommend Favorite

Method to rank and unrank semi-standard Young tableau for a partition of n

By K. V. Dinesha P. C. P. Bhatt

International Journal of Computer Mathematics, Vol. 82, Iss. 1, 2005-01 ,pp. : 41-45

Taylor & Francis Ltd

Access to resources Recommend Favorite

Tableau complexes

By Knutson Allen

Israel Journal of Mathematics, Vol. 163, Iss. 1, 2008-01 ,pp. : 317-343

Springer Publishing Company

Access to resources Recommend Favorite

Discretization vs. Rounding Error in Euler's Method

By Borges Carlos F.

The College Mathematics Journal, Vol. 42, Iss. 5, 2011-11 ,pp. : 396-399

Mathematical Association of America

Access to resources Recommend Favorite