ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: On the Computational Complexity of Betti Numbers: Reductions from Matrix Rank
Article URLs:
Alternative Article URLs:
Authors: Herbert Edelsbrunner
  • IST Austria, Klosterneuburg, Austria
Salman Parsa
  • Duke Univ., Durham, North Carolina
  • IST Austria, Klosterneuburg, Austria
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/EdelsbrunnerP14
Author Comments:

Discuss this paper and its artifacts below