| Titre : | Problems of reducing the exhaustive search | | Type de document : | texte imprimé | | Auteurs : | V. KREINOVICH, Editeur scientifique ; G. MINTS, Editeur scientifique | | Editeur : | Providence, R. I. [Etats Unis] : American Mathematical Society | | Année de publication : | Cop. 1997 | | Collection : | American Mathematical Society Translations. Series 2, ISSN 0065-9290 num. 178 | | Importance : | X-189 p. | | ISBN/ISSN/EAN : | 978-0-8218-0386-8 | | Langues : | Anglais Langues originales : Russe | | Catégories : | 03D15
68Q15
68Q60
| | Mots-clés : | complexité computationnelle | | Résumé : | This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in Problemy Sokrashcheniya Perebora, published in Russian in 1987 by the Scientific Council ''Cybernetics'' of the USSR Academy of Sciences. The problems form the nucleus of this intensively developing area. This translation is dedicated to the memory of two remarkable Russian mathematicians, Sergei Maslov and his wife, Nina Maslova. Maslov is known as the originator of the inverse method in automated deduction, which was discovered at the same time as the resolution method of J. A. Robinson and has approximately the same range of applications. In 1981, Maslov proposed an iterative algorithm for propositional satisfiability based on some general ideas of search described in detail in his posthumously published book, Theory of Deductive Systems and Its Applications (1986; English 1987). This collection contains translations of papers on proposititional satisfiability and related logical problems. The papers related to Maslov's iterative method of search reduction play a significant role. | | Note de contenu : | références |
Problems of reducing the exhaustive search [texte imprimé] / V. KREINOVICH, Editeur scientifique ; G. MINTS, Editeur scientifique . - Providence, R. I. (Etats Unis) : American Mathematical Society, Cop. 1997 . - X-189 p.. - ( American Mathematical Society Translations. Series 2, ISSN 0065-9290; 178) . ISBN : 978-0-8218-0386-8 Langues : Anglais Langues originales : Russe | Catégories : | 03D15
68Q15
68Q60
| | Mots-clés : | complexité computationnelle | | Résumé : | This collection contains translations of papers on propositional satisfiability and related logical problems which appeared in Problemy Sokrashcheniya Perebora, published in Russian in 1987 by the Scientific Council ''Cybernetics'' of the USSR Academy of Sciences. The problems form the nucleus of this intensively developing area. This translation is dedicated to the memory of two remarkable Russian mathematicians, Sergei Maslov and his wife, Nina Maslova. Maslov is known as the originator of the inverse method in automated deduction, which was discovered at the same time as the resolution method of J. A. Robinson and has approximately the same range of applications. In 1981, Maslov proposed an iterative algorithm for propositional satisfiability based on some general ideas of search described in detail in his posthumously published book, Theory of Deductive Systems and Its Applications (1986; English 1987). This collection contains translations of papers on proposititional satisfiability and related logical problems. The papers related to Maslov's iterative method of search reduction play a significant role. | | Note de contenu : | références |
|  |
Affiner la recherche Interroger des sources externesCryptographic applications of analytic number theory / Igor SHPARLINSKI (Cop. 2003)
Logic and computer science / S. Homer (1990)
