The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...
: This paper deals with a special class of three-degree-of-freedom parallel manipulators. First, the singular configurations of the two Jacobian matrices are studied. The isotropic...
: Monte Carlo Study of Taxonomy Evaluation Alexander Ulanov, Georgy Shevlyakov, Nikolay Lyubomishchenko, Pankaj Mehra, Vladimir Polutin HP Laboratories HPL-2010-147 Taxonomy evalu...
Alexander Ulanov, Georgy Shevlyakov, Nikolay Lyubo...