Decomposition representations of logical equations in problems of inversion of discrete functions
Alexander Alexeevich Semenov · Journal of Computer and Systems Sciences International · 2009
Problems of inversion of discrete functions that are deterministically computable for polynomial time is considered. The propositional approach, which is based on the technique of representation of algorithms as systems of logical equations, is applied.