Input-Thrifty Extrema Testing

DOI10.1007/978-3-642-25591-5_57MaRDI QIDQ3104656zbMATHOpenAlexFDO

Authors Kuan-Chieh Robert Tseng, David Kirkpatrick

Publication date 16 December 2011

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25591-5_57

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Testing unateness nearly optimally
• On testing extreme value conditions
• Almost Optimal Testers for Concise Representations.
• Testing extreme value conditions
• Exhaustive testing of almost all devices with outputs depending on limited number of inputs
• Approximate testing with error relative to input size.
• scientific article; zbMATH DE number 3844815
• Efficient testing without efficient regularity

Cited in

(5)

• Algorithms for Queryable Uncertainty
• Hyperbolic Dovetailing
• Query-competitive algorithms for cheapest set problems under uncertainty
• Exhaustive testing of almost all devices with outputs depending on limited number of inputs
• Minimizing co-location potential of moving entities

This page was built for publication: Input-Thrifty Extrema Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3104656)