Polynomially Complete Fault Detection Problems - UF CISE

0 downloads 2 Views 3MB Size Report
nomial time algorithm, tautology problem, traveling salesman maximal clique of a graph, multiprocessor job scheduling, problem, Turing machines (TM's).