My sweet little girl

As they say in math, lets form a notation which can be typed on the standard Qwerty keyboard, and then a postulate.

A' - stand for inverted A, which means : 'for every'

E' - mirror image of E, which means: 'there exists'

iff - if and only if

<--> - one to one

'All other things remaining the same, A' guy who loves, E' a sweet little girl, with a <--> correspondence.'

Now that we have formed the language, lets denote a function:

F(x) where x is the guy.

Now that we have the function, we want to find solution for F(nishant). We will have to design optimal algorithms and datastructures for that. Also, the solution should have a solution in polynomial time. This world allows only a finite time-space solution, NP complete alogorithms can be realized only in utopian time-space.

And when we do we get a realization of this function, the next step is to devise a inverse function:

G(y) = F'(x).

And then this will bring us to another postulate:

A' x that satisfies F(x) in polynomial time, E' y and vice versa.

All I want is a solution to this algorithm, and find my y. Are you my y?