scholarly journals On the Space Complexity of Parameterized Problems

2012 ◽  
pp. 206-217 ◽  
Author(s):  
Michael Elberfeld ◽  
Christoph Stockhusen ◽  
Till Tantau
Keyword(s):  
Space Complexity

Research on Asset Recognition Algorithm of Information Security Product Based on Decision Tree Algorithm

2013 ◽  
Vol 397-400 ◽  
pp. 2296-2300 ◽  
Author(s):  
Fei Shuai ◽  
Jun Quan Li
Keyword(s):  
Computational Complexity ◽  
Information Security ◽  
Decision Tree ◽  
Recognition Algorithm ◽  
Space Complexity ◽  
Complex Relationship ◽  
Decision Tree Algorithm ◽  
Tree Algorithm ◽  
C4.5 Algorithm ◽  
C4.5 Decision Tree

In current, there are complex relationship between the assets of information security product. According to this characteristic, we propose a new asset recognition algorithm (ART) on the improvement of the C4.5 decision tree algorithm, and analyze the computational complexity and space complexity of the proposed algorithm. Finally, we demonstrate that our algorithm is more precise than C4.5 algorithm in asset recognition by an application example whose result verifies the availability of our algorithm.Keywordsdecision tree, information security product, asset recognition, C4.5

On the Time-Space Complexity of Geometric Elimination Procedures

2001 ◽  
Vol 11 (4) ◽  
pp. 239-296 ◽  
Author(s):  
Joos Heintz ◽  
Guillermo Matera ◽  
Ariel Waissbein
Keyword(s):  
Space Complexity ◽  
Time Space

How significant are the known collision and element distinctness quantum algorithms?

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph
Keyword(s):  
Search Algorithm ◽  
Quantum Algorithms ◽  
Search Space ◽  
Space Complexity ◽  
Quantum Search ◽  
Quantum Search Algorithm ◽  
Time Space ◽  
Simple Quantum ◽  
Structured Problems ◽  
Better Than

Quantum search is a technique for searching $N$ possibilities for a desired target in $O(\sqrt{N})$ steps. It has been applied in the design of quantum algorithms for several structured problems. Many of these algorithms require significant amount of quantum hardware. In this paper we propose the criterion that an algorithm which requires $O(S)$ hardware should be considered significant if it produces a speedup of better than $O\left(\sqrt{S}\right)$ over a simple quantum search algorithm. This is because a speedup of $O\left(\sqrt{S}\right)$ can be trivially obtained by dividing the search space into $S$ separate parts and handing the problem to $S$ independent processors that do a quantum search (in this paper we drop all logarithmic factors when discussing time/space complexity). Known algorithms for collision and element distinctness exactly saturate the criterion.

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.

Sign in / Sign up

Export Citation Format

Share Document