Input-Thrifty Extrema Testing

DOI10.1007/978-3-642-25591-5_57zbMATH Open1350.68157OpenAlexW114064698MaRDI QIDQ3104656FDOQ3104656

David Kirkpatrick, Kuan-Chieh Robert Tseng

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

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
• Efficient testing without efficient regularity

Mathematics Subject Classification ID

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

Cited In (5)

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

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)