Keywords
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.
This work was supported in part by Hungarian National Science Foundation grant OTKA F 4204.
Preview
Unable to display preview. Download preview PDF.
References
B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.
U. Faigle, Gy. Turán, Sorting and recognition problems for ordered sets, SIAM J. Comput., 17 (1988), 100–113.
D. E. Knuth, The Art of Computer Programming, Vol.3, Sorting and Searching, Addison-Wesley, Reading, 1973.
H. J. Prömel, Counting unlabeled structures, J. Combin. Theory Ser. A, 44(1987), 83–93.
M. Saks, Recognition problems for transitive relations, unpublished manuscript, 1988.
A. Yao, Lower bounds to randomized algorithms for graph properties, Proc. 28th IEEE FOCS (1987), 393–400.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gröger, H.D. (1993). Does transitivity help? On the complexity of poset properties. In: Ésik, Z. (eds) Fundamentals of Computation Theory. FCT 1993. Lecture Notes in Computer Science, vol 710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57163-9_22
Download citation
DOI: https://doi.org/10.1007/3-540-57163-9_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57163-6
Online ISBN: 978-3-540-47923-9
eBook Packages: Springer Book Archive