AN ALGORITHM FOR COMPUTING THE UNIVERSAL INPUT OF STRAIGHT LINE PROGRAM
Ji Wang · Journal of Gansu Sciences · 1999
The straight line programs and computa ti on trees are two better models of computation for the research of algebraic prob lems over a ring(or a field),especially the Lower bounds of the complexity of th e complexity.For a straight line program Γ,there is a universal input (U;u),su ch that for any other input (A;a) on which Γ is executable is a homomorphic i mage of (U;u).An algorithm for computing the universal input of a consistent str aight line program is given.