M. K. Valiev, “The complexity of the word problem for finitely presented groups”, Algebra Logika, 8:1 (1969), 5

Algebra i logika

RUS ENG

JOURNALS PEOPLE ORGANISATIONS CONFERENCES SEMINARS VIDEO LIBRARY PACKAGE AMSBIB

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

	General information
	Latest issue
	Archive
	Impact factor

	Search papers
	Search references

	RSS
	Latest issue
	Current issues
	Archive issues
	What is RSS

Algebra Logika:
Year:
Volume:
Issue:
Page:
	Find

Personal entry:
Login:
Password:
	Save password
	Enter
	Forgotten password?
	Register

Algebra i logika, 1969, Volume 8, Number 1, Pages 5–43 (Mi al1180)

The complexity of the word problem for finitely presented groups

M. K. Valiev

Full-text PDF (1633 kB)

Received: 12.07.1968

Bibliographic databases:

Document Type: Article

UDC: 51.01:518.5:519.45

Language: Russian

Citation: M. K. Valiev, “The complexity of the word problem for finitely presented groups”, Algebra Logika, 8:1 (1969), 5–43

Citation in format AMSBIB

\Bibitem{Val69}

\by M.~K.~Valiev

\paper The complexity of the word problem for finitely presented groups

\jour Algebra Logika

\yr 1969

\vol 8

\issue 1

\pages 5--43

\mathnet{http://mi.mathnet.ru/al1180}

\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=0306334}

Linking options:

https://www.mathnet.ru/eng/al1180

https://www.mathnet.ru/eng/al/v8/i1/p5

Citing articles in Google Scholar: Russian citations, English citations
Related articles in Google Scholar: Russian articles, English articles

Registration to the website

Logotypes