Title :
Test instance generation for promised NP search problems
Author_Institution :
Dept. of Comput. Sci., Tokyo Inst. of Technol., Japan
fDate :
28 Jun- 1 Jul 1994
Abstract :
We discuss the problem of generating test instances for promised NP search problems. A technical framework is proposed for studying this problem, and it is shown that all known distNP-hard search problems are “complete” for test instance generation problems
Keywords :
computational complexity; probability; search problems; NP search problems; completeness; distNP-hard search problems; probability; test instance generation; test instance generation problems; Computer science; Cryptographic protocols; NP-complete problem; Polynomials; Probability distribution; Search problems; Silicon compounds; Testing;
Conference_Titel :
Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth Annual
Conference_Location :
Amsterdam
Print_ISBN :
0-8186-5670-0
DOI :
10.1109/SCT.1994.315803
