so the question is in the title basically but I am now studying for a Complexity Theory Exam and encountered this problem in the exercises. I understand how to make a poly-reduction but I am not able to wrap my head around how to do it in logarithmic space.
The question itself is as follows
Show that $Clique \leq_L Half-Clique.$ any help would be appreciated!
I am adding the definitions for comfort purposes: $$ Clique = (G,k) : G \ is\ a\ graph\ that\ has\ a\ clique\ of\ size\ k$$ $$ Half-Clique = G : G \ is\ a\ graph\ that\ has\ a\ clique\ of\ size\ |V|/2$$