|
|
|
|
|
Rameez Asif
The latest quantum computers have the ability to solve incredibly complex classical cryptography equations particularly to decode the secret encrypted keys and making the network vulnerable to hacking. They can solve complex mathematical problems almost ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Andreas Emil Feldmann, Karthik C. S., Euiwoong Lee and Pasin Manurangsi
Parameterization and approximation are two popular ways of coping with NP-hard problems. More recently, the two have also been combined to derive many interesting results. We survey developments in the area both from the algorithmic and hardness perspect...
ver más
|
|
|
|
|
|
|
|
|
|
|
Takeo Hagiwara and Tatsuie Tsukiji
Langton?s ant is a deterministic cellular automaton studied in many fields, artificial life, computational complexity, cryptography, emergent dynamics, Lorents lattice gas, and so forth, motivated by the hardness of predicting the ant?s macroscopic behav...
ver más
|
|
|
|
|
|
|
|
|
|
|
Mohammad Abouei Mehrizi and Gianlorenzo D'Angelo
Nowadays, many political campaigns are using social influence in order to convince voters to support/oppose a specific candidate/party. In election control via social influence problem, an attacker tries to find a set of limited influencers to start diss...
ver más
|
|
|
|
|
|
|
|
|
|
|
Yuan Ping, Baocang Wang, Shengli Tian, Jingxian Zhou and Hui Ma
By introducing an easy knapsack-type problem, a probabilistic knapsack-type public key cryptosystem (PKCHD) is proposed. It uses a Chinese remainder theorem to disguise the easy knapsack sequence. Thence, to recover the trapdoor information, the implicit...
ver más
|
|
|
|
|
|
|
|
|
|
|
Kortsarz, G. Krauthgamer, R. Lee, J. R.
Pág. 704 - 720
|
|
|
|
|
|