Complexity of the Problem of Being Equivalent to Horn Formulas Full article
| Journal |
Algebra and Logic
ISSN: 0002-5232 , E-ISSN: 1573-8302 |
||
|---|---|---|---|
| Output data | Year: 2021, Volume: 60, Number: 6, Pages: 380-388 Pages count : 9 DOI: 10.1007/s10469-022-09665-z | ||
| Tags | Horn formula; m-reducibility Σ01 set | ||
| Authors |
|
||
| Affiliations |
|
Cite:
Kogabaev N.T.
Complexity of the Problem of Being Equivalent to Horn Formulas
Algebra and Logic. 2021. V.60. N6. P.380-388. DOI: 10.1007/s10469-022-09665-z WOS Scopus РИНЦ OpenAlex
Complexity of the Problem of Being Equivalent to Horn Formulas
Algebra and Logic. 2021. V.60. N6. P.380-388. DOI: 10.1007/s10469-022-09665-z WOS Scopus РИНЦ OpenAlex
Original:
Когабаев Н.Т.
О сложности проблемы эквивалентности хорновским формулам
Алгебра и логика. 2021. Т.60. №6. С.575–586. DOI: 10.33048/alglog.2021.60.605 РИНЦ
О сложности проблемы эквивалентности хорновским формулам
Алгебра и логика. 2021. Т.60. №6. С.575–586. DOI: 10.33048/alglog.2021.60.605 РИНЦ
Identifiers:
| Web of science: | WOS:000788412400001 |
| Scopus: | 2-s2.0-85128912979 |
| Elibrary: | 48431120 |
| OpenAlex: | W4225100976 |