scholarly journals On Quantum Algorithm for Binary Search and Its Computational Complexity

2015 ◽  
Vol 22 (03) ◽  
pp. 1550019 ◽  
Author(s):  
S. Iriyama ◽  
M. Ohya ◽  
I.V. Volovich
Keyword(s):  
Computational Complexity ◽  
Time Complexity ◽  
Quantum Algorithm ◽  
Binary Search ◽  
Search Problem

A new quantum algorithm for the search problem and its computational complexity are discussed. Its essential part is the use of the so-called chaos amplifier, [8, 9, 10, 13]. It is shown that for the search problem containing [Formula: see text] objects time complexity of the method is polynomial in [Formula: see text].

VERIFIER-BASED ALGORITHM FOR UNSORTED DATABASE SEARCH PROBLEM

2007 ◽  
Vol 05 (04) ◽  
pp. 597-604 ◽  
Author(s):  
XIAO DI WU ◽  
GUI LU LONG
Keyword(s):  
Computational Complexity ◽  
Quantum Algorithm ◽  
Engineering Problem ◽  
Database Search ◽  
Search Problem ◽  
Science And Engineering ◽  
Grover Algorithm

Unsorted database search problem is an important science and engineering problem. We proposed quantum algorithm to solve the problem by dividing the database binarily and then use a probabilistic verifier algorithm to determine if the item is within one part of the divided database. We analyzed the computational complexity of this algorithm, and found that in general, the number of steps is proportional to that in the standard Grover algorithm. However in some cases, it is less than that of the Grover algorithm.

Word search problem

2011 ◽  
pp. 199-246
Author(s):  
Alexei Myasnikov ◽  
Vladimir Shpilrain ◽  
Alexander Ushakov
Keyword(s):  
Search Problem ◽  
Word Search

scholarly journals A fast solution to the conjugacy problem in the four-strand braid group

2014 ◽  
Vol 17 (5) ◽  
Author(s):  
Matthieu Calvez ◽  
Bert Wiest
Keyword(s):  
Computational Complexity ◽  
Braid Group ◽  
Conjugacy Problem ◽  
Search Problem ◽  
Fast Solution ◽  
Conjugacy Search Problem ◽  
Conjugacy Search

AbstractWe present an algorithm for solving the conjugacy search problem in the four-strand braid group. The computational complexity is cubic with respect to the braid length.

scholarly journals ON THE CONJUGACY PROBLEM IN CERTAIN METABELIAN GROUPS

2018 ◽  
Vol 61 (2) ◽  
pp. 251-269
Author(s):  
JONATHAN GRYAK ◽  
DELARAM KAHROBAEI ◽  
CONCHITA MARTINEZ-PEREZ
Keyword(s):  
Computational Complexity ◽  
Time Complexity ◽  
Discrete Logarithm ◽  
Conjugacy Problem ◽  
Discrete Logarithm Problem ◽  
Search Problem ◽  
Metabelian Groups ◽  
Conjugacy Search Problem ◽  
Conjugacy Search

AbstractWe analyze the computational complexity of an algorithm to solve the conjugacy search problem in a certain family of metabelian groups. We prove that in general the time complexity of the conjugacy search problem for these groups is at most exponential. For a subfamily of groups, we prove that the conjugacy search problem is polynomial. We also show that for a different subfamily the conjugacy search problem reduces to the discrete logarithm problem.

scholarly journals Computational Algorithms for Deep and Shallow Word Search in Sanskrit with Case-inflected Forms of Feminine and Neuter Nouns

2019 ◽  
Vol 8 (4) ◽  
pp. 3085-3094
Keyword(s):  
Language Processing ◽  
Search Algorithm ◽  
Search Problem ◽  
Computational Algorithms ◽  
The Novel ◽  
Search Results ◽  
Fast Search Algorithm ◽  
Word Forms ◽  
Word Search ◽  
First Time

Effective and comprehensive word-search in Sanskrit E-text is a non-trivial problem in natural language processing that has been solved in this work for the first time in the literature. The problem is also one of great benefit to a variety of users. The complexity of the problem stems from the fact that words in Sanskrit can get completely metamorphosed on account of the phenomena of euphonic conjunctions and case-inflected forms. This work deals with the case-inflected forms of feminine and neuter gender nouns in particular, and their bearing on the search problem. The novel computational model presented here for generating case-inflected forms of Sanskrit nouns involves a categorization of word forms and a development of new formulae to achieve the generation of case-inflected forms. Pre-processing to improve the performance of the algorithm based on these formulae has also been developed. This model has been extended to include processing of euphonic conjunctions to enable a more elaborate search and to thereby produce meaningful search results. The dual paradigms of deep/slow and shallow/fast searching have been handled in this work and the efficiency of the fast search algorithm developed is shown to have an increased efficiency of 77-80%. The work also discusses the trade-off between search accuracy and speed in the context of word-search in Sanskrit E-text.

Sign in / Sign up

Export Citation Format

Share Document