Data Structures and Algorithms

1907 Submissions

[2] viXra:1907.0199 [pdf] submitted on 2019-07-11 10:51:29

Determining Satisfiability of 3-Sat in Polynomial Time

Authors: Ortho Flint, Asanka Wickramasinghe, Jay Brasse, Chris Fowler
Comments: 41 Pages. The paper has been submitted for peer-review.

In this paper, we provide a polynomial time (and space), algorithm that determines satisfiability of 3-SAT. The complexity analysis for the algorithm takes into account no efficiency and yet provides a low enough bound, that efficient versions are practical with respect to today's hardware. We accompany this paper with a serial version of the algorithm without non-trivial efficiencies (link: polynomial3sat.org).
Category: Data Structures and Algorithms

[1] viXra:1907.0115 [pdf] submitted on 2019-07-07 22:46:14

An Interesting Insight Into [ Cool-Spe/gccs-Gentle Compiler Construction System ] Software in the Context of Computational Complexity of Ising Spin Glass Models Towards [dna/rna] Based High Performance Sequencing and Theoretical Analysis of Gene Therapy R

Authors: Nirmal Tej Kumar
Comments: 4 Pages. Short Communication & Simple Suggestion

An Interesting Insight into [ CooL-SPE/GCCS-Gentle Compiler Construction System ] Software in the Context of Computational Complexity of Ising Spin Glass Models towards [DNA/RNA] based High Performance Sequencing and Theoretical Analysis of Gene Therapy R&D. [ Spin Glasses are always an inspiration – A Computational Challenge for the 21 st Century ? ] [The CooL-SPE is a programming environment specially designed to support the professional development of large-scale object-oriented application systems . Revisiting CooL-SPE in the Context of Bio-informatics ]
Category: Data Structures and Algorithms