Testing metric properties

DOI10.1016/S0890-5401(03)00160-3zbMath1076.68034OpenAlexW1965911513MaRDI QIDQ1877548

Michal Parnas, Dana Ron

Publication date: 19 August 2004

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0890-5401(03)00160-3

zbMATH Keywords

decision problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Randomized algorithms (68W20)

Related Items

Distribution-free connectivity testing for sparse graphs

Cites Work

• Computational complexity of inferring phylogenies from dissimilarity matrices
• The complexity of ultrametric partitions on graphs
• A fast algorithm for constructing trees from distance matrices
• A robust model for finding optimal evolutionary tree
• Property testing and its connection to learning and approximation
• On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)
• Testing of Clustering
• Robust Characterizations of Polynomials with Applications to Program Testing
• Determining the Evolutionary Tree Using Experiments
• Testing metric properties
• Abstract Combinatorial Programs and Efficient Property Testers
• Property testing in bounded degree graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item