scholarly journals Efisiensi Algoritma dan Notasi O-Besar

2011 ◽  
Vol 2 (2) ◽  
pp. 849 ◽  
Author(s):  
Subandijo Subandijo
Keyword(s):  
Time Complexity ◽  
Space Complexity ◽  
Brute Force ◽  
Running Time ◽  
Complexity Function

Efficiency or the running time of an algorithm is usually calculated with time complexity or space complexity as a function of various inputs. It is common to estimate their complexity in the asymptotic sense, i.e., to estimate the complexity function for arbitrarily large input. Brute-force algorithm is the easiest way to calculate the performance of the algorithm. However, it is not recommended since it does not sufficiently explain the efficiency of the algorithm. Asymptotic estimaties are used because different implementations of the same algorithm may differ in efficiency. The big-O notation is used to generate the estimation. 

BRUTE FORCE DETERMINIZATION OF NFAs BY MEANS OF STATE COVERS

2005 ◽  
Vol 16 (03) ◽  
pp. 441-451 ◽  
Author(s):  
J.-M. CHAMPARNAUD ◽  
F. COULON ◽  
T. PARANTHOËN
Keyword(s):  
Time Complexity ◽  
Regular Expression ◽  
Blow Up ◽  
Finite Automata ◽  
A Priori ◽  
Search Algorithms ◽  
Space Complexity ◽  
Brute Force ◽  
Practical Applications ◽  
Space And Time

Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of determinization. There exist solutions to control the space and time complexity like the so called "on the fly" determinization. Another solution consists in performing brute force determinization, which is robust and technically fast, although a priori its space complexity constitutes a weakness. However, one can reduce this complexity by perfoming a partial brute force determinization. This paper provides optimizations that consist in detecting classes of unreachable states and transitions of the subset automaton, which leads in average to an exponential reduction of the complexity of brute force and partial brute force determinization.

scholarly journals A Proof “P≠NP” for P vs. NP Problem by Multiple-Tape Turing-Machine

2020 ◽  
Vol 12 (4) ◽  
pp. 1
Author(s):  
Yaozhi Jiang
Keyword(s):  
Parallel Processing ◽  
Turing Machine ◽  
Time Complexity ◽  
Research Direction ◽  
Space Complexity ◽  
Brute Force ◽  
Computation Complexity ◽  
Serial Processing ◽  
Np Problem ◽  
Important Research Direction

P vs. NP problem is very important research direction in computation complexity theory. In this paper author, by an engineer’s viewpoint, establishes universal multiple-tape Turing-machine and k-homogeneous multiple-tape Turing-machine, and by them we can obtain an unified mathematical model for algorithm-tree, from the unified model for algorithm-tree, we can conclude that computation complexity for serial processing NP problem if under parallel processing sometimes we can obtain P=NP  in time-complexity, but that will imply another NP, non-deterministic space-complexity NP, i.e., under serial processing P≠NP  in space-complexity, and the result is excluded the case of NP problem that there exists a faster algorithm to replace the brute-force algorithm, and hence we can proof that under parallel processing time-complexity is depended on space-complexity, and vice verse, within P vs. NP problem, this point is just the natural property of P vs. NP problem so that “P≠NP ”.

scholarly journals Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials

VLSI Design ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-7 ◽  
Author(s):  
Yin Li ◽  
Yu Zhang ◽  
Xiaoli Guo
Keyword(s):  
Time Delay ◽  
Special Class ◽  
Time Complexity ◽  
Space Complexity ◽  
Polynomial Basis ◽  
Gate Delay ◽  
Complexity Bound ◽  
Parallel Multiplier ◽  
Highly Efficient ◽  
First Time

Recently, we present a novel Mastrovito form of nonrecursive Karatsuba multiplier for all trinomials. Specifically, we found that related Mastrovito matrix is very simple for equally spaced trinomial (EST) combined with classic Karatsuba algorithm (KA), which leads to a highly efficient Karatsuba multiplier. In this paper, we consider a new special class of irreducible trinomial, namely, xm+xm/3+1. Based on a three-term KA and shifted polynomial basis (SPB), a novel bit-parallel multiplier is derived with better space and time complexity. As a main contribution, the proposed multiplier costs about 2/3 circuit gates of the fastest multipliers, while its time delay matches our former result. To the best of our knowledge, this is the first time that the space complexity bound is reached without increasing the gate delay.

scholarly journals Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android

2021 ◽  
Vol 1 (2) ◽  
pp. 54-60
Author(s):  
Candra Irawan ◽  
Mudafiq Riyan Pratama
Keyword(s):  
String Matching ◽  
Search Process ◽  
Brute Force ◽  
Text Search ◽  
Matching Algorithm ◽  
Running Time ◽  
The Right ◽  
Bahasa Indonesia ◽  
Testing Criteria

String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm. The Boyer-Moore algorithm is a string matching algorithm published by Robert S. Boyer and J. Strother Moore in 1977. This algorithm is considered the most efficient algorithm in general applications. The Boyer-Moore algorithm starts matching characters from the pattern on the right. While the Brute Force algorithm is an algorithm that matches a pattern with all text between 0 and n-m to find the existence of a pattern in the text. These two algorithms have different patterns in the search process. In this article, a comparative analysis of the performance of the Boyer-Moore and Brute Force algorithms is carried out in a case study of the search for the Big Indonesian Dictionary (KBBI) based on Android. The search process is carried out by searching based on words and word descriptions. The results of this study indicate that the criteria for running time, the Brute Force algorithm is faster than the Boyer-Moore algorithm with the total running time of the Brute Force algorithm is 168.3 ms in words, 6994.16 ms in word descriptions, while the Boyer-Moore algorithm for running time reached 304.7 ms on the word, 8654.77 ms on the word description. In the testing criteria based on related keywords, the two algorithms can display the same list of related keywords.

scholarly journals Cryptanalytic Performance Appraisal of Improved CCH2 Proxy Multisignature Scheme

2014 ◽  
Vol 2014 ◽  
pp. 1-13
Author(s):  
Raman Kumar ◽  
Nonika Singla
Keyword(s):  
Elliptic Curve ◽  
Performance Appraisal ◽  
Time Complexity ◽  
Space Complexity ◽  
Elliptic Curve Cryptosystem ◽  
Forgery Attack ◽  
Signature Schemes ◽  
Computational Overhead ◽  
Threshold Schemes

Many of the signature schemes are proposed in which thetout ofnthreshold schemes are deployed, but they still lack the property of security. In this paper, we have discussed implementation of improved CCH1 and improved CCH2 proxy multisignature scheme based on elliptic curve cryptosystem. We have represented time complexity, space complexity, and computational overhead of improved CCH1 and CCH2 proxy multisignature schemes. We have presented cryptanalysis of improved CCH2 proxy multisignature scheme and showed that improved CCH2 scheme suffered from various attacks, that is, forgery attack and framing attack.

An Efficient Algorithm for Automating Classification of Chemical Reactions into Classes in Ugi’s Reaction Scheme

2013 ◽  
pp. 285-296
Author(s):  
Sanjay Ram ◽  
Somnath Pal
Keyword(s):  
Chemical Reactions ◽  
Efficient Algorithm ◽  
Time Complexity ◽  
Symmetric Matrix ◽  
Reaction Scheme ◽  
Space Complexity ◽  
Average Case ◽  
Model Driven ◽  
Reaction Matrix

There are two approaches for classification of chemical reactions: Model-Driven and Data-Driven. In this paper, the authors develop an efficient algorithm based on a model-driven approach developed by Ugi and co-workers for classification of chemical reactions. The authors’ algorithm takes reaction matrix of a chemical reaction as input and generates its appropriate class as output. Reaction matrices being symmetric, matrix implementation of Ugi’s scheme using upper/lower tri-angular matrix is of O(n2) in terms of space complexity. Time complexity of similar matrix implementation is O(n4), both in worst case as well as in average case. The proposed algorithm uses two fixed size look-up tables in a novel way and requires constant space complexity. Time complexity both in worst and average cases of the algorithm is linear.

scholarly journals Space and time complexity for infinite time Turing machines

2020 ◽  
Vol 30 (6) ◽  
pp. 1239-1255
Author(s):  
Merlin Carl
Keyword(s):  
Time Complexity ◽  
Space Complexity ◽  
Complexity Classes ◽  
Turing Machines ◽  
Infinite Time ◽  
Space And Time ◽  
Open Questions ◽  
Separation Results ◽  
Ordinal Computability

Abstract We consider notions of space by Winter [21, 22]. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P$_{+}=$PSPACE$_{+}$ and P$_{++}=$PSPACE$_{++}$ holds for ITTMs (all three are false). We also show various separation results between space complexity classes for ITTMs. This considerably expands our earlier observations on the topic in Section 7.2.2 of Carl (2019, Ordinal Computability: An Introduction to Infinitary Machines), which appear here as Lemma $6$ up to Corollary $9$.

scholarly journals Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures

2017 ◽  
Vol 43 (3) ◽  
pp. 465-520 ◽  
Author(s):  
Kilian Gebhardt ◽  
Mark-Jan Nederhof ◽  
Heiko Vogler
Keyword(s):  
Time Complexity ◽  
Hierarchical Structures ◽  
Experimental Results ◽  
Grammar Induction ◽  
Linear Structures ◽  
Syntactic Structures ◽  
Running Time ◽  
Dependency Structures ◽  
Time Accuracy

We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures. Covered are both discontinuous phrase structures and non-projective dependency structures. Technically, hybrid grammars are related to synchronous grammars, where one grammar component generates linear structures and another generates hierarchical structures. By coupling lexical elements of both components together, discontinuous structures result. Several types of hybrid grammars are characterized. We also discuss grammar induction from treebanks. The main advantage over existing frameworks is the ability of hybrid grammars to separate discontinuity of the desired structures from time complexity of parsing. This permits exploration of a large variety of parsing algorithms for discontinuous structures, with different properties. This is confirmed by the reported experimental results, which show a wide variety of running time, accuracy, and frequency of parse failures.

An Algorithm for Testing Isomorphism of Planer Graph Based on Distant Matrix

2012 ◽  
Vol 487 ◽  
pp. 317-321
Author(s):  
Yan Peng Wu ◽  
Shui Qiang Liu
Keyword(s):  
Graph Theory ◽  
Polynomial Time ◽  
Time Complexity ◽  
Graph Isomorphism ◽  
Distance Matrix ◽  
Space Complexity ◽  
The Subject ◽  
The Many

The testing for graph isomorphism is one of the many problems in the subject of graph theory. This thesis proposes an algorithm for testing isomorphism of planer graph of polynomial time via structuring characteristics of planer graph based on distance matrix. The algorithm, with a time complexity of O (n^4) and a space complexity of O (n^2), has a great application value.

Improved Algorithm of Global Model-Checking for Propositional μ-Calculus

2012 ◽  
Vol 263-266 ◽  
pp. 2314-2319
Author(s):  
Hua Jiang ◽  
Jian Qing Xi
Keyword(s):  
Model Checking ◽  
Time Complexity ◽  
Transition System ◽  
Global Model ◽  
Space Complexity ◽  
Partial Ordering ◽  
Improved Algorithm

Based on the research of the author when he was a Ph.D. student, he deeply studied the proposition of μ-Calculus, and used solving the partial ordering relation in formula μ-Calculus to solve formula μ-Calculus quickly. This paper improves and perfects the algorithm in reference [11]. The time complexity of the algorithm in this paper is O((2n+1)^(d/2+1)), its space complexity is O(dn), where n is the number of states in the transition system and d is the nesting depth of fixpoint operators in the formula of proposition μ-Calculus.

Sign in / Sign up

Export Citation Format

Share Document