Can we factor an integer $$N$$ unconditionally, in deterministic polynomial time, given the value of its Euler totient $$\varphi (N)$$ ? We show that this can be done under certain size conditions on prime factors . The key technique is lattice basis reduction using LLL algorithm. Among our results, if has a $$p > \sqrt{N}$$ , then recover $$p$$ time also shed some light analogous factorization...

This paper presents a framework to infer spatial knowledge from verbal semantic role representations. First, we generate potential spatial knowledge deterministically. Second, we determine whether it can be inferred and a degree of certainty. Inferences capture that something is located or is not located somewhere, and temporally anchor this information. An annotation effort shows that inferenc...