scientific article; zbMATH DE number 1534404

From MaRDI portal

Revision as of 08:48, 7 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4517198

Jump to:navigation, search

zbMath0956.20026MaRDI QIDQ4517198

Alexander Yu. Ol'shanskii

Publication date: 21 November 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

computational complexity Turing machines word problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (2)

On some measures of complexity of finite abelian groups ⋮ On the computation complexity of the systems of finite abelian group elements

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4517198&oldid=18620522"