Used together with:
circuit
(1)
lower
(1)
bound
(1)
explicit
(1)
Stem
boolena$ (
all stems
)
1 papers:
STOC-2001-LachishR
#bound
Explicit lower bound of 4.5n — o(n) for boolena circuits (
OL
,
RR
), pp. 399–408.
Bibliography of Software Language Engineering in Generated Hypertext
(
BibSLEIGH
) is created and maintained by
Dr. Vadim Zaytsev
.
Hosted as a part of
SLEBOK
on
GitHub
.