The clustered Sparrow algorithm

04/30/2018
by   Cristian Dumitrescu, et al.
0

In this paper, we study an extension of Schoning's algorithm [Schoning, 1991] for 3SAT, the clustered Sparrow algorithm We also present strong arguments that this algorithm is polynomial.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/06/2021

A Reply to "On Salum's Algorithm for X3SAT"

This paper is a reply to "On Salum's Algorithm for X3SAT" (arXiv:2104.02...
research
02/03/2014

Associative Memories Based on Multiple-Valued Sparse Clustered Networks

Associative memories are structures that store data patterns and retriev...
research
08/17/2017

Neville's algorithm revisited

Neville's algorithm is known to provide an efficient and numerically sta...
research
07/10/2015

A Hybrid Graph-drawing Algorithm for Large, Naturally-clustered, Disconnected Graphs

In this paper, we present a hybrid graph-drawing algorithm (GDA) for lay...
research
07/10/2020

Solving the Clustered Traveling Salesman Problem via TSP methods

The Clustered Traveling Salesman Problem (CTSP) is a variant of the popu...
research
08/22/2018

Efficient sparse Hessian based algorithms for the clustered lasso problem

We focus on solving the clustered lasso problem, which is a least square...
research
12/07/2006

Clustering fetal heart rate tracings by compression

Fetal heart rate (FHR) monitoring, before and during labor, is a very im...

Please sign up or login with your details

Forgot password? Click here to reset