| 000 | 01530nmm a2200169Ia 4500 | ||
|---|---|---|---|
| 008 | 230301s9999||||xx |||||||||||||||||und|| | ||
| 020 | _a9781470433895 (online) | ||
| 245 | 0 |
_aProblems of reducing the exhaustive search / _cV. Kreinovich, G. Mints, editors. _hSeries 2, volume 178 |
|
| 260 |
_aProvidence, R.I. : _bAmerican Mathematical Society, _cc1997. |
||
| 300 | _a1 online resource (x, 189 p. : ill.) | ||
| 490 | _aAmerican Mathematical Society Translations: Series 2, | ||
| 504 | _aIncludes bibliographical references. | ||
| 505 |
_tAlgorithmics 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) |
||
| 650 | _aComputational complexity | ||
| 700 | _aKreinovich, Vladik.Mints, G. E. | ||
| 856 | _uhttp://www.ams.org/trans2/178 | ||
| 999 |
_c28245 _d28245 |
||