Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving

zbMath0646.94021MaRDI QIDQ1104301

Edouard G. Belaga

Publication date: 1989

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

locally synchronous CS-complexitym-dimensional cyclic convolutionmincing complexityrelative circuit-size complexity of a Boolean functionstraight-line Boolean computationssyntax and semantics of Boolean circuits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06)

Related Items (1)

Bilinear mincing rank

This page was built for publication: Through the mincing machine with a Boolean layer cake: nonstandard computations over Boolean circuits in the lower-bounds-to-circuit-size complexity proving