This note presents a deterministic integer factorization algorithm based on a system of polynomials equations. This technique exploits a new idea in the construction of irreducible polynomials with parametized roots, and recent advances in polynomial lattices reduction methods. The main result establishes a new deterministic time complexity bench mark. 1 Introduction This note presents a determ...

in this paper, construction rules of the root locus of a positive feedback system whose loop transfer function is not strictly proper have been investigated. the root locus method is being used since 1950. it is demonstrated that some of the steps in this technique are not general and for a positive feedback system whose loop transfer function is not strictly proper are not valid. to overcome t...

Call graph construction has been an important area of research within the compilers and programming languages community. However, all existing techniques focus on exhaustive analysis of all the call-sites in the program. With increasing importance of just-in-time or dynamic compilation and use of program analysis as part of the software development environments, we believe that there is a need ...