scientific article; zbMATH DE number 3848613

MaRDI QIDQ3318113zbMATH OpenFDO

Authors V. M. Amerbaev, Yu. F. Kasimov

Publication date 1983

zbMATH Keywords

complexity measureterm tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of computing (68Q99)

Recommendations

• COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
• scientific article; zbMATH DE number 515222
• scientific article; zbMATH DE number 475242
• Parallelizable algebras
• Computational complexity in algebraic systems

Cited in

(7)

• Computation in polynomial algebras and ideals
• Computer algebra libraries for combinatorial structures
• Computing Schur complexes
• Computing the structure of finite algebras
• Computation with semialgebraic sets represented by cylindrical algebraic formulas
• Some new computable structures of high rank
• Prolongations and Computational Algebra

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 Q3318113)