Browsing by Subject NP-COMPLETE

Jump to: 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
А Б В Г Д Е Ж З И Й К Л М Н О П Р С Т У Ф Х Ц Ч Ш Щ Ъ Ы Ь Э Ю Я
or enter first few letters:  
Showing results 1 to 20 of 26  next >
Issue DateTitleAuthor(s)
2013Computational experiments for the problem of hamiltonian path with fixed number of color repetitionsGorbenko, A.; Popov, V.
2012Computational experiments for the problem of selection of a minimal set of visual landmarksGorbenko, Anna; Popov, Vladimir
2012The far from most string problemGorbenko, Anna; Popov, Vladimir
2013The farthest substring problemGorbenko, A.; Popov, V.
2012Footstep planning for humanoid robotsGorbenko, Anna; Popov, Vladimir
2013A graph-based model of object recognition self-learningGorbenko, A.
2012Hamiltonian alternating cycles with fixed number of color appearancesGorbenko, Anna; Popov, Vladimir
2012The hamiltonian alternating path problemGorbenko, Anna; Popov, Vladimir
2012The longest common parameterized subsequence problemGorbenko, Anna; Popov, Vladimir
2013Longest common parameterized subsequences with fixed common substringGorbenko, A.; Popov, V.
2013The minimum test collection problemGorbenko, A.; Popov, V.
2012Multi-agent path planningGorbenko, Anna; Popov, Vladimir
2012Multiple occurrences shortest common superstring problemGorbenko, Anna; Popov, Vladimir
2013On Hamilton paths in grid graphsGorbenko, A.; Popov, V.
2013On multiple occurrences shortest common superstring problemGorbenko, A.; Popov, V.
2012On the longest common subsequence problemGorbenko, Anna; Popov, Vladimir
2013On the shortest common parameterized supersequence problemGorbenko, A.; Popov, V.
2012The problem of selection of a minimal set of visual landmarksGorbenko, Anna; Popov, Vladimir
2013The problem of selection of a set of partially distinguishable guardsGorbenko, A.; Popov, V.
2013Restricted common superstringsGorbenko, A.; Popov, V.