Data Structures and Algorithms

1502 Submissions

[4] viXra:1502.0231 [pdf] submitted on 2015-02-26 04:57:01

A Swot Analysis of Instruction Sequence Theory

Authors: Jan A. Bergstra
Comments: 23 Pages.

After 15 years of development of instruction sequence theory (IST) writing a SWOT analysis about that project is long overdue. The paper provides a comprehensive SWOT analysis of IST based on a recent proposal concerning the terminology for the theory and applications of instruction sequences.
Category: Data Structures and Algorithms

[3] viXra:1502.0228 [pdf] submitted on 2015-02-25 17:47:05

A Terminology for Instruction Sequencing

Authors: Jan A. Bergstra
Comments: 19 Pages.

Instruction sequences play a key role in computing and have the potential of becoming more important in the conceptual development of informatics in addition to their existing role in computer technology and machine architectures. After 15 years of development of instruction sequence theory a more robust and outreaching terminology is needed for it which may support further development. Instruction sequencing is the central concept around which a new family of terms and phrases is developed.
Category: Data Structures and Algorithms

[2] viXra:1502.0047 [pdf] submitted on 2015-02-05 23:42:58

Simple Proof that P=NP

Authors: Phil Ascio
Comments: 1 Page.

We shall reassess the simplex algorithm by observing an injective semi-separable morphism. Recent interest in affine, geometric functionals has centered on studying linearly n-dimensional, minimal random variables in NP. In contrast, we shall show that there exists a combinatorially Cauchy projective set acting algebraically on P to demonstrate that P=NP.
Category: Data Structures and Algorithms

[1] viXra:1502.0003 [pdf] replaced on 2015-02-07 06:24:59

An Interesting Perspective to the P Versus NP Problem

Authors: Wenming Zhang
Comments: 5 Pages. This is a short and interesting paper.

We discuss the P versus NP problem from the perspective of addition operation about polynomial functions. Two contradictory propositions for the addition operation are presented. With the proposition that the sum of k (k<=n+1) polynomial functions on n always yields a polynomial function, we prove that P=NP, considering the maximum clique problem. And with the proposition that the sum of k polynomial functions may yield an exponential function, we prove that P!=NP by constructing an abstract decision problem. Furthermore, we conclude that P=NP and P!=NP if and only if the above propositions hold, respectively.
Category: Data Structures and Algorithms