Zapiski Nauchnykh Seminarov POMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




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

Zapiski Nauchnykh Seminarov POMI, 1999, Volume 258, Pages 161–184 (Mi znsl1022)  
This article is cited in 1 scientific paper (total in 1 paper)

Algorithms in algebraic topology and homological algebra: the problem of the complexity

P. R. Hurado, V. Álvarez, J. A. Armario, R. Gonsáles-Días

Universidad de Sevilla, Facultad de Matemáticas
Full-text PDF (296 kB) Citations (1)
Abstract: This survey tackles the problem of the high computational complexity lying in most of the algorithms in Algebraic Topology and Homological Algebra. We deal with three particular algorithms: the computation of the homology of commutative differential graded algebras, the homology of principal twisted cartesian products of Eilenberg–Mac Lane spaces and a combinatorial method computing Steenrod Squares.
Received: 25.09.1999
English version:
Journal of Mathematical Sciences (New York), 2002, Volume 108, Issue 6, Pages 1015–1033
DOI: https://doi.org/10.1023/A:1013544506151
Bibliographic databases:
UDC: 512.5+513.841
Language: English
Citation: P. R. Hurado, V. Álvarez, J. A. Armario, R. Gonsáles-Días, “Algorithms in algebraic topology and homological algebra: the problem of the complexity”, Representation theory, dynamical systems, combinatorial and algoritmic methods. Part IV, Zap. Nauchn. Sem. POMI, 258, POMI, St. Petersburg, 1999, 161–184; J. Math. Sci. (New York), 108:6 (2002), 1015–1033
Citation in format AMSBIB
\Bibitem{HurAlvArm99}
\by P.~R.~Hurado, V.~\'Alvarez, J.~A.~Armario, R.~Gons\'ales-D{\'\i}as
\paper Algorithms in algebraic topology and homological algebra: the problem of the complexity
\inbook Representation theory, dynamical systems, combinatorial and algoritmic methods. Part~IV
\serial Zap. Nauchn. Sem. POMI
\yr 1999
\vol 258
\pages 161--184
\publ POMI
\publaddr St.~Petersburg
\mathnet{http://mi.mathnet.ru/znsl1022}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1755838}
\zmath{https://zbmath.org/?q=an:0999.16009}
\transl
\jour J. Math. Sci. (New York)
\yr 2002
\vol 108
\issue 6
\pages 1015--1033
\crossref{https://doi.org/10.1023/A:1013544506151}
Linking options:
  • https://www.mathnet.ru/eng/znsl1022
  • https://www.mathnet.ru/eng/znsl/v258/p161
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Записки научных семинаров ПОМИ
    Statistics & downloads:
    Abstract page:148
    Full-text PDF :87
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024