Skip to main content
SpringerLink
Log in

Does transitivity help? On the complexity of poset properties

  • Communications
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 710))

Included in the following conference series:

  • 147 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Bollobás, Extremal Graph Theory, Academic Press, New York, 1978.

    Google Scholar 

  2. U. Faigle, Gy. Turán, Sorting and recognition problems for ordered sets, SIAM J. Comput., 17 (1988), 100–113.

    Article  Google Scholar 

  3. D. E. Knuth, The Art of Computer Programming, Vol.3, Sorting and Searching, Addison-Wesley, Reading, 1973.

    Google Scholar 

  4. H. J. Prömel, Counting unlabeled structures, J. Combin. Theory Ser. A, 44(1987), 83–93.

    Article  Google Scholar 

  5. M. Saks, Recognition problems for transitive relations, unpublished manuscript, 1988.

    Google Scholar 

  6. A. Yao, Lower bounds to randomized algorithms for graph properties, Proc. 28th IEEE FOCS (1987), 393–400.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Berzsenyi Dániel Teachers' College, Károlyi Gáspár tér 4, H-9701, Szombathely

    Hans Dietmar Gröger

Authors
  1. Hans Dietmar Gröger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Zoltán Ésik

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation