scholarly journals Space Complexity in Polynomial Calculus

Author(s):  
Yuval Filmus ◽  
Massimo Lauria ◽  
Jakob Nordstrom ◽  
Neil Thapen ◽  
Noga Ron-Zewi
2015 ◽  
Vol 44 (4) ◽  
pp. 1119-1153 ◽  
Author(s):  
Yuval Filmus ◽  
Massimo Lauria ◽  
Jakob Nordström ◽  
Noga Ron-Zewi ◽  
Neil Thapen

1998 ◽  
Vol 7 (4) ◽  
pp. 291-324 ◽  
Author(s):  
A.A. Razborov

2013 ◽  
Vol 397-400 ◽  
pp. 2296-2300 ◽  
Author(s):  
Fei Shuai ◽  
Jun Quan Li

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


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

2004 ◽  
Vol 4 (3) ◽  
pp. 201-206
Author(s):  
L. Grover ◽  
T. Rudolph

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.


Sign in / Sign up

Export Citation Format

Share Document