scientific article; zbMATH DE number 1507184

zbMATH Open0964.08007MaRDI QIDQ4503904

Thierry Boy de la Tour

Publication date: 14 September 2000

Title of this publication is not available (Why is that?)

zbMATH Keywords

complexityisomorphism problemsorted algebras

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of universal algebra in computer science (08A70) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Model theory of finite structures (03C13)

Related Items (1)

The computational complexity of deciding whether a finite algebra generates a minimal variety

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4503904)