Abstract
By the Central Element Theorem of Linial and Saks, it follows that for the problem of (generalised) searching in posets, the information-theoretic lower bound of log N comparisons (where N is the number of order-ideals in the poset) is tight asymptotically. We observe that this implies that the problem of (generalised) sorting in posets has complexity Θ(n · log N) (where n is the number of elements in the poset). We present schemes for (efficiently) transforming a randomised generation procedure for central elements (which often exists for some classes of posets) into randomised procedures for approximately counting ideals in the poset and for testing if an arbitrary element is central.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Dyer, A. Frieze and R. Kannan: A Random Polynomial Time Algorithm for Approximating the Volume of Convex Bodies J. ACM 38:1 1–17(1991).
U. Faigle, L. Lovász, R. Schrader and Gy. Turán: Searching in Trees, Series-Parallel and Interval Orders, SIAM J. Computing, 12:4, 1075–1084,(1986).
U. Faigle and Gy. Turán: Sorting and Recognition Problems for Ordered Sets, SIAM J. Computing, 17:1, 100–113, (1988).
M. Jerrum and A. Sinclair: Approximating the Permanent SIAM J. Computing 18:6, 1149–1178 (1989).
N. Linial and M. Saks: Every Poset has a Central Element, J. Comb. Theory, Series A 40, 195–210 (1985).
J.S. Provan and M.O. Ball: The Complexity of Counting Cuts and Computing the Probability that a Graph is Connected SIAM J. Computing 12 777–788 (1983).
U. Schöning: Complexity and Structure Lecture Notes in Computer Science, 211, Springer-Verlag Berlin Heidelberg New York, (1985)
C.E. Shannon: A mathematical theory of communication, Bell System Tech. Journal 27, 379–423 and 623–656 (1948)
G. Steiner: Searching in 2-Dimensional Partial Orders, Journal of Algorithms 8, 95–105, (1987).
A.C.C. Yao Probabilistic Computations: Towards a Unified Measure of Complexity 18th Annual Symp. on Foundations of Comp. Sci., 222–227 (1977)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubhashi, D.P., Mehlhorn, K., Ranjan, D., Thiel, C. (1993). Searching, sorting and randomised algorithms for Central Elements and ideal counting in posets. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_75
Download citation
DOI: https://doi.org/10.1007/3-540-57529-4_75
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57529-0
Online ISBN: 978-3-540-48211-6
eBook Packages: Springer Book Archive