Advertisement

Fast recognition of rings and lattices

  • P. Goralčík
  • A. Goralčíková
  • V. Koubek
  • V. Rödl
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 117)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    G. Birkhoff, S. Mac Lane, Algebra, The Macmillan Comp., N. Y., 1967.Google Scholar
  2. [2]
    A. Goralčíková, P. Goralčík, V. Koubek, Testing of Properties of Finite Algebras, Proceedings of ICALP '80, Springer-Verlag 1979, 273–281.Google Scholar
  3. [3]
    A. Goralčíková, V. Koubek, A Reduct and Closure Algorithm for Graphs, Proceedings of MFCS' 79, Springer-Verlag 1979, 301–307.Google Scholar
  4. [4]
    R. E. Tarjan, Determining whether a Groupoid is a Group, Inf. Proc. Letters 1(1972), 120–124.Google Scholar
  5. [5]
    J. Vuillemin, Comment verifier si une boucle est un groupe, Technical Report, Université de Paris-Sud, 1976, 1–12.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • P. Goralčík
    • 1
  • A. Goralčíková
    • 1
  • V. Koubek
    • 1
  • V. Rödl
    • 2
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPrahaCSSR
  2. 2.Faculty of Nuclear EngineeringTechnical UniversityPrahaCSSR

Personalised recommendations