메뉴 건너뛰기





Volumn , Issue , 1991, Pages 650-661

On the complexity of computing the homology type of a triangulation

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER METATHEORY - COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING - ALGORITHMS; MATHEMATICAL TECHNIQUES - COMBINATORIAL MATHEMATICS; TRIANGULATION;

EID: 0026400396     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (24)

References (27)
  • Reference 정보가 존재하지 않습니다.

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