AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Problems of Reducing the Exhaustive Search
About this Title
V. Y Kreinovich and Grigori E Mints, Stanford University, Editors. Translated by V Minachin
Publication: American Mathematical Society Translations: Series 2
Publication Year:
1997; Volume 178
ISBNs: 978-0-8218-0386-8 (print); 978-1-4704-3389-5 (online)
DOI: https://doi.org/10.1090/trans2/178
MathSciNet review: MR1423605
MSC: Primary 03-06; Secondary 03B35, 68-06, 68Q15, 68Q25, 90B40
ReadershipTable of Contents
Download chapters as PDF
Front/Back Matter
Chapters
- R. I. Freidzon – Algorithmics of $NP$-hard problems
- E. Ya. Dantsin – Algorithmics of propositional satisfiability problems
- V. Ya. Kreinovich – Semantics of S. Yu. Maslov’s iterative method
- M. I. Zakharevich – Ergodic properties of Maslov’s iterative method
- I. V. Melichev – Anomalous properties of Maslov’s iterative method
- Yu. V. Matiyasevich – Possible nontraditional methods of establishing unsatisfiability of propositional formulas
- G. V. Davydov and I. M. Davydova – Dual algorithms in discrete optimization
- A. Ya. Dikovsky – Models, methods, and modes for the synthesis of program schemes
- M. I. Kanovich – Effective calculi as a technique for search reduction
- N. K. Kossovskiĭ – Lower bounds of combinatorial complexity for exponential search reduction
- An. A. Muchnik – On a class of polynomial systems of equations following from the formula for total probability and possibilities for eliminating search in solving them
- V. Kreinovich – S. Maslov’s iterative method: 15 years later (freedom of Choice, neural networks, numerical optimization, uncertainty reasoning, and chemical computing)