Love is an NP complete problem

Thats that...love is an NP complete problem...may be it does have a solution, and maybe you can test if that solution is right or not (trial and error or parameteric method); ...but by yourself you cannot figure out the perfect way of having all the ingredients and cooking this love recipe i.e finding a solution to this problem...since this word kind of sickens me out, lets just call this "condition X"

So, the thing is, "condition X" refuses to be limited in a set of statements, due to its numerous variables....everyone thinks he's an expert of somekind to define this (otherwise a trite case of non-deterministic polynomial time problem) in his own expert way...since the complexity of this problem is beyond the scope of this blog, wont try getting into that shit...

So due to its such nature, no algorithm has been developed so far to completely tackle it..but I'm sure there are some heuristics...which are kept secret and only found in cryptic language of poetry or art...which are probably double NP, hence not very trusted in solving "condition X"...but for benefit(or not) most people, low efficiency algorithms are widely available in many movies...

So this "condition X" remains an open problem, so go and fuddle with it in you own fuckin' expert way...