Электронный научный архив УрФУ: Просмотр архива электронных ресурсов

Просмотр коллекции по группе - По тематике NP-COMPLETE

Перейти к: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
или введите несколько первых букв:

Отображение результатов 7 до 26 из 26 < назад

Дата публикации	Название	Авторы
2012	Hamiltonian alternating cycles with fixed number of color appearances	Gorbenko, A.; Popov, V.
2012	The hamiltonian alternating path problem	Gorbenko, Anna; Popov, Vladimir
2012	The longest common parameterized subsequence problem	Gorbenko, A.; Popov, V.
2013	Longest common parameterized subsequences with fixed common substring	Gorbenko, A.; Popov, V.
2013	The minimum test collection problem	Gorbenko, A.; Popov, V.
2012	Multi-agent path planning	Gorbenko, A.; Popov, V.
2012	Multiple occurrences shortest common superstring problem	Gorbenko, A.; Popov, V.
2013	On Hamilton paths in grid graphs	Gorbenko, A.; Popov, V.
2013	On multiple occurrences shortest common superstring problem	Gorbenko, A.; Popov, V.
2012	On the longest common subsequence problem	Gorbenko, A.; Popov, V.
2013	On the shortest common parameterized supersequence problem	Gorbenko, A.; Popov, V.
2012	The problem of selection of a minimal set of visual landmarks	Gorbenko, A.; Popov, V.
2013	The problem of selection of a set of partially distinguishable guards	Gorbenko, A.; Popov, V.
2013	Restricted common superstrings	Gorbenko, A.; Popov, V.
2012	The set of parameterized k-covers problem	Gorbenko, A. A.; Popov, V. Yu.
2013	The shortest common ordered supersequence problem	Gorbenko, A.
2013	The shortest common parameterized supersequence problem	Gorbenko, A.; Popov, V.
2013	The shortest common superstring problem	Gorbenko, A.; Popov, V.
2013	The string barcoding problem	Gorbenko, A.; Popov, V.
2013	The swap common superstring problem	Gorbenko, A.; Popov, V.

Отображение результатов 7 до 26 из 26 < назад