π
π
The Cartographer
A Polynomial Decision for 3-SAT
August 20, 2022 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Angela Weiss
arXiv ID
2208.12598
Category
cs.DS: Data Structures & Algorithms
Citations
1
Venue
arXiv.org
Last Checked
4 months ago
Abstract
We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or not. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular 3-SAT formula, called pivoted 3-SAT and, after a plain transformation, still keeping the polynomial boundaries, it is shown that 3-SAT formulas can be written as pivoted formulas.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Data Structures & Algorithms
R.I.P.
π»
Ghosted
Route Planning in Transportation Networks
R.I.P.
π»
Ghosted
Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration
R.I.P.
π»
Ghosted
Hierarchical Clustering: Objective Functions and Algorithms
R.I.P.
π»
Ghosted
Graph Isomorphism in Quasipolynomial Time
π
π
The Cartographer
Simulation optimization: A review of algorithms and applications
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted