Random Question (1) October 25, 2009
Posted by jagadeeshbp in Uncategorized.Tags: algorithms, computational complexity
add a comment
Are there transformers for P problems, like SAT in NP-Complete? For all problems X in P, there’s a single problem Y s.t. Y is polynomial time reducible to X?
