Data Structures and Algorithms

2009 Submissions

[3] viXra:2009.0077 [pdf] submitted on 2020-09-11 09:12:55

Fuzzy Time & NP Hardness (P*=BPP*, P*≠NP*)

Authors: Farzad Didehvar
Comments: 9 Pages.

We have shown the plausibility of considering time as a Fuzzy concept instead of classical time [7], [8]. By considering time as a fuzzy concept, we will have new classes of Complexity. Here, we show that how some famous problems will be solved in this new picture.
Category: Data Structures and Algorithms

[2] viXra:2009.0076 [pdf] submitted on 2020-09-11 09:13:21

P≠NP, by Accepting to Make a Shift in the Theory (Time as a Fuzzy Concept) the Structure of a Theory (TC*, Theory of Computation Based on Fuzzy Time)

Authors: Farzad Didehvar
Comments: Pages.

In a series of articles we try to show the need of a novel Theory for Theory of Computation based on considering time as a Fuzzy concept. Time is a central concept In Physics. First we were forced to consider some changes and modifications in the Theories of Physics. In the second step and throughout this article we show the positive Impact of this modification on Theory of Computation and Complexity Theory to rebuild it in a more successful and fruitful approach. We call this novel Theory TC*.
Category: Data Structures and Algorithms

[1] viXra:2009.0035 [pdf] submitted on 2020-09-04 11:06:02

The Cover Theorem By Eliahu Shaykevich

Authors: Eliahu Shaykevich
Comments: 10 Pages.

There is such a historical number of deals N0 of both parities and such a way of placing them on the market that for any N> ��0 the inequality M + (��) ≥��− (��) + ��− (��) (9) we will call it the "Shaykevich Inequality" or the Covering Theorem (CoverTheorem)
Category: Data Structures and Algorithms