Hardness Results for Homology Localization

Article Properties
Cite
Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization”. Discrete &Amp; Computational Geometry, vol. 45, no. 3, 2011, pp. 425-48, https://doi.org/10.1007/s00454-010-9322-8.
Chen, C., & Freedman, D. (2011). Hardness Results for Homology Localization. Discrete &Amp; Computational Geometry, 45(3), 425-448. https://doi.org/10.1007/s00454-010-9322-8
Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization”. Discrete &Amp; Computational Geometry 45, no. 3 (2011): 425-48. https://doi.org/10.1007/s00454-010-9322-8.
Chen C, Freedman D. Hardness Results for Homology Localization. Discrete & Computational Geometry. 2011;45(3):425-48.
Journal Categories
Science
Mathematics
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Technology
Engineering (General)
Civil engineering (General)
Refrences
Title Journal Journal Categories Citations Publication Date
Measuring and computing natural generators for homology groups Computational Geometry
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
15 2010
10.1090/S0273-0979-09-01249-X Bulletin of the American Mathematical Society 2009
Finding the Homology of Submanifolds with High Confidence from Random Samples Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
214 2008
Reductions, completeness and the hardness of approximability European Journal of Operational Research
  • Technology: Manufactures: Production management. Operations management
  • Technology: Technology (General): Industrial engineering. Management engineering
  • Technology: Engineering (General). Civil engineering (General)
7 2006
10.1142/S021819590600204X 2006
Citations
Title Journal Journal Categories Citations Publication Date
The parameterized complexity of finding minimum bounded chains Computational Geometry
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
2024
Stable volumes for persistent homology

Journal of Applied and Computational Topology 1 2023
Computing Persistent Homology by Spanning Trees and Critical Simplices

Research
  • Science
  • Science: Science (General)
2 2023
Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
2022
Persistence Cycles for Visual Exploration of Persistent Homology IEEE Transactions on Visualization and Computer Graphics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
2022
Citations Analysis
The category Science: Mathematics 8 is the most commonly referenced area in studies that cite this article. The first research to cite this article was titled Structural Analysis of Multivariate Point Clouds Using Simplicial Chains and was published in 2014. The most recent citation comes from a 2024 study titled The parameterized complexity of finding minimum bounded chains. This article reached its peak citation in 2021, with 3 citations. It has been cited in 17 different journals, 23% of which are open access. Among related journals, the Discrete & Computational Geometry cited this research the most, with 3 citations. The chart below illustrates the annual citation trends for this article.
Citations used this article by year