Data Structures and Algorithms

1810 Submissions

[7] viXra:1810.0351 [pdf] submitted on 2018-10-21 12:39:19

The Minimal Encoding Size of Any NP-C Problem Solver is Superpolynomial in Its Input Size

Authors: Mai Ben Adar Bessos
Comments: 3 Pages.

The famous open question P=?NP motivates new methods for characterizing the theoretical limitations of polynomial-time algorithms. In this note, we show that if P=NP, then the minimal code size of a poly-time algorithm (e.g. the number of bits necessary for encoding a finite state turing machine) that may solve any NP-Complete problem is superpolynomial in the size of the input that the algorithm receives. To do this, we assume that exists a poly-time algorithm A that solves any specific NP-Complete decision problem, where the input to the algorithm is exactly N bits. Then, we repeatedly define new NP decision problems (i.e. new verifiers) that may not be solved by any poly-time algorithm that is encoded with <=|A| bits, unless our assumption does not hold. The formal proof is surprisingly simple, and only relies on Cook-Levin Theorem and basic arithmetic.
Category: Data Structures and Algorithms

[6] viXra:1810.0227 [pdf] submitted on 2018-10-14 09:18:20

Third Edition: Complex Programming

Authors: Yuly Shipilevsky
Comments: 9 Pages.

We introduce and suggest to research a special class of optimization problems, wherein an objective function is a real-valued complex variables function and constraints comprising complex-valued complex variables functions
Category: Data Structures and Algorithms

[5] viXra:1810.0197 [pdf] submitted on 2018-10-12 17:56:39

Proof of P = NP

Authors: Young TAB-LO
Comments: 1 Page.

N/A
Category: Data Structures and Algorithms

[4] viXra:1810.0189 [pdf] submitted on 2018-10-13 04:56:51

Cyber Breach of Travel Records

Authors: George Rajna
Comments: 64 Pages.

The Pentagon on Friday said there has been a cyber breach of Defense Department travel records that compromised the personal information and credit card data of U.S. military and civilian personnel. [41] Quantum secure direct communication transmits secret information directly without encryption. [40] Physicists at The City College of New York have used atomically thin two-dimensional materials to realize an array of quantum emitters operating at room temperature that can be integrated into next generation quantum communication systems. [39] Research in the quantum optics lab of Prof. Barak Dayan in the Weizmann Institute of Science may be bringing the development of such computers one step closer by providing the "quantum gates" that are required for communication within and between such quantum computers. [38] Calculations of a quantum system's behavior can spiral out of control when they involve more than a handful of particles. [37] Researchers from the University of North Carolina at Chapel Hill have reached a new milestone on the way to optical computing, or the use of light instead of electricity for computing. [36] The key technical novelty of this work is the creation of semantic embeddings out of structured event data. [35] The researchers have focussed on a complex quantum property known as entanglement, which is a vital ingredient in the quest to protect sensitive data. [34] Cryptography is a science of data encryption providing its confidentiality and integrity. [33] Researchers at the University of Sheffield have solved a key puzzle in quantum physics that could help to make data transfer totally secure. [32]
Category: Data Structures and Algorithms

[3] viXra:1810.0103 [pdf] submitted on 2018-10-07 18:13:41

Refutation of Optimization as Complex Programming

Authors: Colin James III
Comments: 1 Page. © Copyright 2018 by Colin James III All rights reserved. Respond to the author by email at: info@ersatz-systems dot com.

The optimization paradigm is not tautologous, hence refuting complex programming as that paradigm as a new class.
Category: Data Structures and Algorithms

[2] viXra:1810.0096 [pdf] submitted on 2018-10-06 08:08:06

Developing a New Cryptic Communication Protocol by Quantum Tunnelling over Classic Computer Logic

Authors: Mesut Kavak
Comments: 2 Pages.

I have been working for a time about basic laws of directing the universe [1,2]. It seems that the most basic and impressive principle which causes any physical phenomenon is the Uncertainty Principle of Heisenberg [3], that existence have any property because of the uncertainty. During this process, while I was thinking about conservation of information I noticed, that information cannot be lost; but at a point, it becomes completely unrecognizable according to us as there is no alternative. Any information and the information searched for become the same after a point relatively to us. The sensitivity increases forever but its loss. Each sensitivity level also has higher level; so actually an absolute protection seems possible.
Category: Data Structures and Algorithms

[1] viXra:1810.0073 [pdf] submitted on 2018-10-05 18:20:15

Second Edition: Complex Programming

Authors: Yuly Shipilevsky
Comments: 9 Pages.

We introduce and suggest to research a special class of optimization problems, wherein an objective function is a real-valued complex variables function and constraints comprising complex-valued complex variables functions.
Category: Data Structures and Algorithms