Irregularities of Partitions pp 137-140
A Note on Boolean Dimension of Posets
We present a universal upper bound for the boolean dimension of posets. We prove that this bound is asymptotically best possible.
Unable to display preview. Download preview PDF.
- J. Friedman: Constructing O(n log n) size monotone formulae for the k-th elementary symmetric polynomial of n variables, Proc. 25 th Annual Symp. on Foundations of Computer Science, IEEE (1984), 506–515.Google Scholar
- G. Gambosi, J. Nešetřil, M. Talamo: Locally presented posets and their applications (submitted to TCS).Google Scholar
- D. Kelly, W. T. Trotter: Dimension theory for ordered sets, In: Ordered sets (ed. I. Rival), P. Reidei Publ. Co (1982), 171–212.Google Scholar