메뉴 건너뛰기




Volumn 41, Issue 1, 2009, Pages 96-118

Coreduction homology algorithm

Author keywords

Cubical set; Homology algorithm; Reduction methods

Indexed keywords


EID: 57849165859     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-008-9073-y     Document Type: Article
Times cited : (72)

References (30)
  • 1
    • 0033436565 scopus 로고    scopus 로고
    • On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets
    • S. Basu 1999 On bounding the Betti numbers and computing the Euler characteristic of semi-algebraic sets Discrete Comput. Geom. 22 1 18
    • (1999) Discrete Comput. Geom. , vol.22 , pp. 1-18
    • Basu, S.1
  • 2
    • 0003193239 scopus 로고
    • Some aspects of the topology of 3-manifolds related to the Poincaré Conjecture
    • Wiley New York
    • Bing, R.H.: Some aspects of the topology of 3-manifolds related to the Poincaré Conjecture. In: Saaty, T.L. (ed.) Lectures on Modern Mathematics, vol. II, pp. 93-128. Wiley, New York (1964)
    • (1964) Lectures on Modern Mathematics , vol.2 , pp. 93-128
    • Bing, R.H.1    Saaty, T.L.2
  • 3
    • 10044257064 scopus 로고
    • An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
    • C.J.A. Delfinado H. Edelsbrunner 1995 An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere Comput. Aided Geom. Des. 12 771 784
    • (1995) Comput. Aided Geom. Des. , vol.12 , pp. 771-784
    • Delfinado, C.J.A.1    Edelsbrunner, H.2
  • 6
    • 0005426657 scopus 로고    scopus 로고
    • On efficient sparse integer matrix Smith normal form computations
    • J.-G. Dumas B.D. Saunders G. Villard 2001 On efficient sparse integer matrix Smith normal form computations J. Symb. Comput. 32 71 99
    • (2001) J. Symb. Comput. , vol.32 , pp. 71-99
    • Dumas, J.-G.1    Saunders, B.D.2    Villard, G.3
  • 7
    • 12944285986 scopus 로고    scopus 로고
    • Computing simplicial homology based on efficient smith normal form algorithms
    • Springer Berlin
    • Dumas, J.-G., Heckenbach, F., Saunders, D., Velker, V.: Computing simplicial homology based on efficient smith normal form algorithms. In: Algebra, Geometry and Software Systems, pp. 177-207. Springer, Berlin (2003)
    • (2003) Algebra, Geometry and Software Systems , pp. 177-207
    • Dumas, J.-G.1    Heckenbach, F.2    Saunders, D.3    Velker, V.4
  • 9
  • 10
    • 10444284320 scopus 로고    scopus 로고
    • Evolution of pattern complexity in the Cahn-Hilliard theory of phase separation
    • M. Gameiro K. Mischaikow Th. Wanner 2005 Evolution of pattern complexity in the Cahn-Hilliard theory of phase separation Acta Mater. 53 693 704
    • (2005) Acta Mater. , vol.53 , pp. 693-704
    • Gameiro, M.1    Mischaikow, K.2    Wanner, Th.3
  • 14
    • 0002713827 scopus 로고    scopus 로고
    • Cubical approximation and computation of homology
    • Banach Center Publications Warsaw
    • Kalies, W., Mischaikow, K., Watson, G.: Cubical approximation and computation of homology. In: Conley Index Theory, vol. 47, pp. 115-131. Banach Center Publications, Warsaw (1999)
    • (1999) Conley Index Theory , vol.47 , pp. 115-131
    • Kalies, W.1    Mischaikow, K.2    Watson, G.3
  • 15
    • 0028434242 scopus 로고
    • Critical behaviour in the satisfiability of random Boolean expressions
    • S. Kirkpatrick B. Selman 1994 Critical behaviour in the satisfiability of random Boolean expressions Science 264 1297
    • (1994) Science , vol.264 , pp. 1297
    • Kirkpatrick, S.1    Selman, B.2
  • 17
    • 22644441282 scopus 로고    scopus 로고
    • Graph approach to the computation of the homology of continuous maps
    • K. Mischaikow M. Mrozek P. Pilarczyk 2005 Graph approach to the computation of the homology of continuous maps Found. Comput. Math. 5 199 229
    • (2005) Found. Comput. Math. , vol.5 , pp. 199-229
    • Mischaikow, K.1    Mrozek, M.2    Pilarczyk, P.3
  • 18
    • 41949108009 scopus 로고    scopus 로고
    • Mrozek, M.: Homology Software (2006). http://www.ii.uj.edu.pl/~mrozek/ software/homology.html
    • (2006) Homology Software
    • Mrozek, M.1
  • 19
    • 33846894097 scopus 로고    scopus 로고
    • Index pairs algorithms
    • M. Mrozek 2006 Index pairs algorithms Found. Comput. Math. 6 457 493
    • (2006) Found. Comput. Math. , vol.6 , pp. 457-493
    • Mrozek, M.1
  • 23
    • 0011283302 scopus 로고
    • Regular cycles of compact metric spaces
    • N.E. Steenrod 1940 Regular cycles of compact metric spaces Ann. Math. 41 833 851
    • (1940) Ann. Math. , vol.41 , pp. 833-851
    • Steenrod, N.E.1
  • 26
    • 0002463920 scopus 로고
    • Computing the minimum fill-in is NP-complete
    • M. Yannakakis 1981 Computing the minimum fill-in is NP-complete SIAM J. Matrix Anal. Appl. 2 77 79
    • (1981) SIAM J. Matrix Anal. Appl. , vol.2 , pp. 77-79
    • Yannakakis, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.