Description
Book SynopsisContains translations of papers on propositional satisfiability and related logical problems which appeared in ""Problemy Sokrashcheniya Perebora"", published in Russian in 1987.
Table of ContentsAlgorithmics of $NP$-hard problems by R. I. Freidzon Algorithmics of propositional satisfiability problems by E. Ya. Dantsin Semantics of S. Yu. Maslov's iterative method by V. Ya. Kreinovich Ergodic properties of Maslov's iterative method by M. I. Zakharevich Anomalous properties of Maslov's iterative method by I. V. Melichev Possible nontraditional methods of establishing unsatisfiability of propositional formulas by Yu. V. Matiyasevich Dual algorithms in discrete optimization by G. V. Davydov and I. M. Davydova Models, methods, and modes for the synthesis of program schemes by A. Ya. Dikovsky Effective calculi as a technique for search reduction by M. I. Kanovich Lower bounds of combinatorial complexity for exponential search reduction by N. K. Kossovskii On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them by An. A. Muchnik S. Maslov's iterative method: 15 years later (freedom of choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing) by V. Kreinovich.
