Includes bibliographical references.

Algorithmics of P hard problems;Algorithmics of propositional satisfiability problems;Semantics of S. Yu. Maslov's iterative method;Ergodic properties of Maslov's iterative method;Anomalous properties of Maslov's iterative method;Possible nontraditional methods of establishing unsatisfiability of propositional formulas;Dual algorithms in discrete optimization;Models, methods, and modes for the synthesis of program schemes;Effective calculi as a technique for search reduction;Lower bounds of combinatorial complexity for exponential search reduction;On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them;S. Maslov's iterative method: 15 years later (freedom of Choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing)