Computing Minimal Persistent Cycles: Polynomial and Hard Cases

doi 10.1137/1.9781611975994.158
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Hard Cases

BMJ
2011English

Computing Images of Polynomial Maps

Advances in Computational Mathematics
Computational MathematicsApplied Mathematics
2019English

Persistent Occipito-Posterior Cases

BMJ
1933English

Computing Minimal Mappings Between Lightweight Ontologies

International Journal on Digital Libraries
LibraryInformation Sciences
2012English

Computing Paths and Cycles in Biological Interaction Graphs

BMC Bioinformatics
BiochemistryApplied MathematicsComputer Science ApplicationsStructural BiologyMolecular Biology
2009English

Metadata Life Cycles, Use Cases and Hierarchies

2018English

Medical Image Segmentation: Hard and Soft Computing Approaches

SN Applied Sciences
2020English

Hard Cases Make Bad Law?

Journal of Medical Ethics
ArtsHumanitiesLegal AspectsHealth PolicyHealthEthicsIssues
1997English

Computing the Interleaving Distance Is NP-Hard

Foundations of Computational Mathematics
MathematicsComputational MathematicsApplied MathematicsAnalysisComputational Theory
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy