scientific article

zbMath0974.68542MaRDI QIDQ2753932

Martin Ziegler, Christian Sohler, Artur Czumaj

Publication date: 11 November 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (10)

Lower bounds for testing Euclidean minimum spanning trees ⋮ Testing convexity of figures under the uniform distribution ⋮ Helly-Type Theorems in Property Testing ⋮ Testing Euclidean Spanners ⋮ The power and limitations of uniform samples in testing properties of figures ⋮ Sample-Based High-Dimensional Convexity Testing. ⋮ Testing hypergraph colorability ⋮ Sublinear-time Algorithms ⋮ Testing subgraphs in directed graphs ⋮ A large lower bound on the query complexity of a simple Boolean function

This page was built for publication: