With no explanation, label text_A→text_B with either "not_related" or "related".
text_A: Gunday is an action thriller film.
text_B: A binary constraint , in mathematical optimization , is a constraint that involves exactly two variables .. mathematical optimization. mathematical optimization. For example , consider the n-queens problem , where the goal is to place n chess queens on an n-by-n chessboard such that none of the queens can attack each other -LRB- horizontally , vertically , or diagonally -RRB- .. n-queens problem. n-queens problem. chess queens. Queen ( chess ). The formal set of constraints are therefore `` Queen 1 ca n't attack Queen 2 '' , `` Queen 1 ca n't attack Queen 3 '' , and so on between all pairs of queens .. Each constraint in this problem is binary , in that it only considers the placement of two individual queens .. Linear programs in which all constraints are binary can be solved in strongly polynomial time , a result that is not known to be true for more general linear programs .. strongly polynomial time. strongly polynomial time
not_related.