Data Structures and Algorithms

1909 Submissions

[3] viXra:1909.0067 [pdf] submitted on 2019-09-03 12:14:28

A Polynomial Time Algorithm for 3-Sat

Authors: Ortho Flint, Asanka Wickramasinghe, Jay Brasse, Chris Fowler
Comments: 7 Pages. Proofs and code can be found at polynomial3sat.org

In this paper, we provide a polynomial time (and space), algorithm that determines satisfiability of 3-SAT.
Category: Data Structures and Algorithms

[2] viXra:1909.0041 [pdf] submitted on 2019-09-02 10:11:55

Refutation of Algorithm for 3-Sat Satisfiability Via Claimed Boolean Rules

Authors: Colin James III
Comments: 2 Pages. Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at ersatz-systems.com.

We evaluate a definition of two Boolean rules claimed for intersection and union as not tautologous. This refutes the subsequent conjecture of an algorithm for 3-SAT satisfiability, to form non tautologous fragments of the universal logic VŁ4.
Category: Data Structures and Algorithms

[1] viXra:1909.0037 [pdf] submitted on 2019-09-02 14:59:53

Refutation of Rewriting Logic for Compositional Specification

Authors: Colin James III
Comments: 2 Pages. Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at ersatz-systems.com.

We evaluate the first motivational example, before mutual exclusion of multiple trains, for states and transitions as defined. The conjectured model is not tautologous, refutes rewriting logic for compositional specification, and forming a non tautologous fragment of the universal logic VŁ4.
Category: Data Structures and Algorithms