Verifying nonrigidity

DOI10.1016/0020-0190(86)90147-XzbMath0587.68042OpenAlexW2912005352MaRDI QIDQ1072373

Pavel Goralčík, Václav Koubek

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90147-x

zbMATH Keywords

NP-completenessendomorphismfinite algebramono- unary algebranonrigid algebra

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Automorphisms and endomorphisms of algebraic structures (08A35) Unary algebras (08A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über Abbildungen von Mengen
• Fast multiplication of large numbers
• On a technique for representing semigroups as endomorphism semigroups of graphs with given properties
• The Complexity of Near-Optimal Graph Coloring
• Graphs and k-Societies

This page was built for publication: Verifying nonrigidity