Approximation polynomial algorithm for the data editing and data cleaning problem

2017 ◽  
Vol 27 (3) ◽  
pp. 365-370 ◽  
Author(s):  
A. A. Ageev ◽  
A. V. Kel’manov ◽  
A. V. Pyatkin ◽  
S. A. Khamidullin ◽  
V. V. Shenmaier
Keyword(s):  
Polynomial Algorithm ◽  
Data Cleaning ◽  
Data Editing ◽  
Approximation Polynomial

Efficient RFID Data Cleaning Model Based on Dynamic Clusters of Monitored Objects

2010 ◽  
Vol 21 (4) ◽  
pp. 632-643 ◽  
Author(s):  
Yu GU ◽  
Ge YU ◽  
Xiao-Long HU ◽  
Yi WANG
Keyword(s):  
Data Cleaning ◽  
Model Based ◽  
Rfid Data

A polynomial algorithm of edge-neighbor-scattering number of trees

2016 ◽  
Vol 283 ◽  
pp. 1-5 ◽  
Author(s):  
Yong Liu ◽  
Zongtian Wei ◽  
Jiarong Shi ◽  
Anchan Mai
Keyword(s):  
Polynomial Algorithm

Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem

2021 ◽  
Vol 31 (1) ◽  
pp. 1-4
Author(s):  
Mikhail A. Cherepnev
Keyword(s):  
Upper Bound ◽  
Polynomial Algorithm ◽  
Integer Factorization ◽  
Factorization Problem ◽  
Diffie Hellman ◽  
Integer Factorization Problem

Abstract We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.

Sign in / Sign up

Export Citation Format

Share Document