Standard

Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation. / Kosovskii, Nikolai K.

Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015. 2015. стр. 56 – 57.

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная

Harvard

Kosovskii, NK 2015, Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation. в Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015. стр. 56 – 57.

APA

Kosovskii, N. K. (2015). Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation. в Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015 (стр. 56 – 57)

Vancouver

Kosovskii NK. Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation. в Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015. 2015. стр. 56 – 57

Author

Kosovskii, Nikolai K. / Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation. Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015. 2015. стр. 56 – 57

BibTeX

@inproceedings{ffe7586dfe15488b92061d3493396397,
title = "Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation",
abstract = "Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of some unification problems are proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.",
keywords = "Equation in words, unification, polynomial-time complexity, NP-complete problem.",
author = "Kosovskii, {Nikolai K.}",
year = "2015",
language = "English",
pages = "56 – 57",
booktitle = "Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015",

}

RIS

TY - GEN

T1 - Computational Complexity for Some Problems of Two Terms Unification Based on Concatenation

AU - Kosovskii, Nikolai K.

PY - 2015

Y1 - 2015

N2 - Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of some unification problems are proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.

AB - Tools for description of bounds for word variable values are offered. The use of these descriptions provides the conditions of a problem belonging to the class P or to the class NP. NP-completeness of some unification problems are proved. The validity of the proved bounds may make possible to create effective algorithms for unification of word terms, used in such programming language as Refal.

KW - Equation in words

KW - unification

KW - polynomial-time complexity

KW - NP-complete problem.

M3 - Conference contribution

SP - 56

EP - 57

BT - Proceedings of the Seventh IEEE International Conference on Intelligent Computing and Information Systems, ICICIS 2015

ER -

ID: 4774773