Lower bounds on the formula complexity of a linear Boolean function

zbMath1355.94105MaRDI QIDQ891988

K. L. Rychkov

Publication date: 18 November 2015

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: http://semr.math.nsc.ru/v11/p165-184.pdf

zbMATH Keywords

formulas\(\pi\)-schemeslower bounds on the formula complexity

Mathematics Subject Classification ID

Boolean functions (06E30)

Related Items (4)

Sufficient conditions for the local repetition-freeness of minimal π-schemes realizing linear Boolean functions ⋮ Complexity of the Realization of a Linear Boolean Function in the Class of π-Schemes ⋮ Unnamed Item ⋮ ON THE MEANING OF WORKS BY V. M. KHRAPCHENKO

This page was built for publication: Lower bounds on the formula complexity of a linear Boolean function