Part of the Algorithms and Combinatorics 8 book series (AC, volume 8)
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.
KeywordsPlanar Graph Positive Answer Symmetric Polynomial Boolean Formula Distinguishing Family
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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
© Springer-Verlag Berlin Heidelberg 1989