On the complexity of computing the homology type of a triangulation
- 9 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 650-661
- https://doi.org/10.1109/sfcs.1991.185432
Abstract
No abstract availableThis publication has 12 references indexed in Scilit:
- On the complexity of computing the homology type of a triangulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Infinite Abelian Groups and Solving Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1989
- Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer MatrixSIAM Journal on Computing, 1989
- The mechanical computation of first and second cohomology groupsJournal of Symbolic Computation, 1985
- Algebraic cell decomposition in NCPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Algorithms for the Solution of Systems of Linear Diophantine EquationsSIAM Journal on Computing, 1982
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979
- Triangulations of algebraic setsProceedings of Symposia in Pure Mathematics, 1975
- Elementary Structure of Real Algebraic VarietiesAnnals of Mathematics, 1957
- Finite Computability of Postnikov ComplexesAnnals of Mathematics, 1957