scientific article; zbMATH DE number 1332677

MaRDI QIDQ4259999zbMATH OpenFDO

Authors Christoph Karg, Rainer Schuler, Johannes Köbler

Publication date 8 September 1999

zbMATH Keywords

NP search problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Searching and sorting (68P10)

Recommendations

• The complexity of generating test instances
• scientific article; zbMATH DE number 1313596
• The test suite generation problem: optimal instances and their implications
• On the complexity of test case generation for NP-hard problems
• Generating tests by example
• On the Complexity of Estimating the Size of a Test Set
• scientific article; zbMATH DE number 1951185

Cited in

(4)

• scientific article; zbMATH DE number 956856 (Why is no real title available?)
• On the complexity of test case generation for NP-hard problems
• The test suite generation problem: optimal instances and their implications
• The complexity of generating test instances

This page was built for publication:

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