Need to prepare a paper a report from some relevant papers.
Report should have these three parts:
1)Prove that NL ⊆ P and NL ⊆ POLYLOGSPACE.
2)Define reductions for the purpose of defining complete problems for the class P. Ex- plain carefully how are your reductions closed under functional composition.
3)Define the class of P-complete problems. Explain carefully how showing that a P- complete problem is in PLOYLOGSPACE results in the whole class P being included in POLYLOGSPACE. Explain the practical consequences of finding that P-complete problems are or are not in POLYLOGSPACE.