Record:   Prev Next
Title Problems of reducing the exhaustive search / [electronic resource] V. Kreinovich, G. Mints, editors
Imprint Providence, R.I. : American Mathematical Society, c1997
book jacket
Descript 1 online resource (x, 189 p. : ill.)
Series American Mathematical Society Translations: Series 2, 0065-9290 (print); 2472-3193 (online); v. 178
Note Includes bibliographical references
Algorithmics of $NP$-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)
Access is restricted to licensed institutions
Electronic reproduction. Providence, Rhode Island : American Mathematical Society. 2012
Mode of access : World Wide Web
Description based on print version record
Link Print version: Problems of reducing the exhaustive search / (DLC) 96027577 0065-9290 9780821803868
Subject Computational complexity
Alt Author Kreinovich, Vladik
Mint︠s︡, G. E
Unif Title Problemy sokrashchenii︠a︡ perebora. English
Record:   Prev Next