## A Hardware Relaxation Paradigm for Solving NP-Hard Problems

Citations: | 1 - 1 self |

### BibTeX

@MISC{Cockshott_ahardware,

author = {Paul Cockshott and Andreas Koltes and Patrick Prosser and Wim V},

title = {A Hardware Relaxation Paradigm for Solving NP-Hard Problems},

year = {}

}

### OpenURL

### Abstract

Digital circuits with feedback loops can solve some instances of NP-hard problems by relaxation: the circuit will either oscillate or settle down to a stable state that represents a solution to the problem instance. This approach differs from using hardware accelerators to speed up the execution of deterministic algorithms, as it exploits stabilisation properties of circuits with feedback, and it allows a variety of hardware techniques that do not have counterparts in software. A feedback circuit that solves many instances of Boolean satisfiability problems is described, with experimental results from a preliminary simulation using a hardware accelerator. Keywords: NP-hard problem, Boolean satisfiability, digital circuit with feedback, relaxation, simulated annealing

### Citations

577 | Where the really hard problems are
- Cheeseman, Kanefsky, et al.
- 1991
(Show Context)
Citation Context ...domly and their solution times measured. Cheeseman, Kanefsky and Taylor observed an abrupt phase transition from solubility to insolubility in graph colouring problems as average degree was increased =-=[4]-=-. A complexity peak was observed at this transition, and it was conjectured that this would be algorithm independent and common to all NP-complete problems. Graph colouring problems were mapped to SAT... |

556 |
The Origins of Order
- Kauffman
- 1993
(Show Context)
Citation Context ...behaviour such as metastability [36]. Given constant inputs, a circuit may stabilise, it may settle down into an oscillation among a set of states, or it may fluctuate chaotically. Kauffman has shown =-=[20]-=- that random Boolean networks of size n have expected median state cycle lengths of O( √ n). Thus a system with a very large state space (e.g. 2 10000 ≈ 10 3000 ) may settle down and cycle among a qui... |

521 | Pushing the envelope: planning, propositional logic and stochastic search
- Kautz, Selman
(Show Context)
Citation Context ...od search algorithm, and often operate as hill climbers (or descenders). Given complete or partial setting of the variables, the settings are improved by making local changes. Solvers such as WalkSat =-=[21]-=- (and its predecessor GSAT) have features that are similar to Tabu search. Heuristics for optimisation strategies are discussed in [9], and runtime distributions of SAT solvers are reviewed in [16]. T... |

460 |
An extensible SAT-solver
- Eén, Sörensson
- 2003
(Show Context)
Citation Context ...te on unsatisfiable instances. They typically use a backtracking search based on the DPLL (Davis, Putnam, Logemann, and Loveland) algorithm. State of the art solvers, such as Zchaff2004 [24], MiniSAT =-=[10, 12, 34]-=- and BerkMin [14] employ relevance bounded learning, intelligent backjumping, and dynamic variable ordering heuristics along with smart data structures such as watched literals. Incomplete solvers typ... |

239 | BerkMin: a Fast and Robust Sat-Solver
- Goldberg, Novikov
- 2002
(Show Context)
Citation Context ...nces. They typically use a backtracking search based on the DPLL (Davis, Putnam, Logemann, and Loveland) algorithm. State of the art solvers, such as Zchaff2004 [24], MiniSAT [10, 12, 34] and BerkMin =-=[14]-=- employ relevance bounded learning, intelligent backjumping, and dynamic variable ordering heuristics along with smart data structures such as watched literals. Incomplete solvers typically use a neig... |

147 | Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
- Gomes, Selman, et al.
(Show Context)
Citation Context ...at [21] (and its predecessor GSAT) have features that are similar to Tabu search. Heuristics for optimisation strategies are discussed in [9], and runtime distributions of SAT solvers are reviewed in =-=[16]-=-. The algorithms for WalkSat and GSAT are shown below: procedure WalkSat input f: array[1..c] of clauses {in CNF} output v:array[1..n] of boolean {a variable assignment that satisfies f} begin for a :... |

116 | The constrainedness of search
- Gent, MacIntyre, et al.
- 1996
(Show Context)
Citation Context ...n are also easy. Much research has been done to pin down the location of the SAT phase transition and to develop theories about the location of this phase transition for problems that are NP-complete =-=[13]-=- or in higher complexity classes (such as quantifies SAT (QSAT)). Research to date appears to confirm that the complexity peak is indeed independent of the algorithm, and it is an open question whethe... |

69 | Jitter and Phase Noise in Ring Oscillators
- Hajimiri, Limotyrakis, et al.
- 1999
(Show Context)
Citation Context ...his signal and then recovering it, we obtain a random pulse train. The frequency of a ring oscillator is proportional to the VDD. An accurate model for the jitter of a ring oscillator is presented in =-=[17]-=-. Using this model it is possible to design a circuit that will generate a pulse with a probability p at a frequency governed by the VDD of the oscillator. BCS International Academic Research Conferen... |

65 | Non-turing computations via Malament–Hogarth space–times
- Etesi, Németi
- 2002
(Show Context)
Citation Context ...gh a solution space whose size is an exponential function of the input size. There have been numerous recent proposals to overcome the barrier of effective computability in computation, and proposals =-=[5, 6, 11, 15]-=- have been put forward for hypercomputers that could compute functions which are uncomputable on a Turing machine. The feasibility of building such devices remains in dispute [7, 25, 33, 8]. A related... |

43 |
Digital Design: Principles and Practices
- Wakerly
(Show Context)
Citation Context ...cuits behave like mathematical state machines. However, unconstrained Boolean networks with feedback can exhibit a variety of complex behaviours, including non-digital behaviour such as metastability =-=[36]-=-. Given constant inputs, a circuit may stabilise, it may settle down into an oscillation among a set of states, or it may fluctuate chaotically. Kauffman has shown [20] that random Boolean networks of... |

40 | Zchaff2004: An Efficient SAT Solver
- Mahajan, Fu, et al.
- 2005
(Show Context)
Citation Context ...and to terminate on unsatisfiable instances. They typically use a backtracking search based on the DPLL (Davis, Putnam, Logemann, and Loveland) algorithm. State of the art solvers, such as Zchaff2004 =-=[24]-=-, MiniSAT [10, 12, 34] and BerkMin [14] employ relevance bounded learning, intelligent backjumping, and dynamic variable ordering heuristics along with smart data structures such as watched literals. ... |

31 |
Satisfiability On Reconfigurable Hardware
- Abramovici, Saab
- 1997
(Show Context)
Citation Context ...s to accelerate satisfiability algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include =-=[3]-=- [38] [27] [1] [39] [2] [26] [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto ... |

28 | Beyond the universal Turing machine
- Copeland, Sylvan
- 1999
(Show Context)
Citation Context ...gh a solution space whose size is an exponential function of the input size. There have been numerous recent proposals to overcome the barrier of effective computability in computation, and proposals =-=[5, 6, 11, 15]-=- have been put forward for hypercomputers that could compute functions which are uncomputable on a Turing machine. The feasibility of building such devices remains in dispute [7, 25, 33, 8]. A related... |

25 | Turing machines, transition systems, and interaction
- Goldin, Smolka, et al.
- 2004
(Show Context)
Citation Context ...gh a solution space whose size is an exponential function of the input size. There have been numerous recent proposals to overcome the barrier of effective computability in computation, and proposals =-=[5, 6, 11, 15]-=- have been put forward for hypercomputers that could compute functions which are uncomputable on a Turing machine. The feasibility of building such devices remains in dispute [7, 25, 33, 8]. A related... |

20 | 2003, ‘Hypercomputation and the Physical Church–Turing Thesis
- Cotogno
(Show Context)
Citation Context ... proposals [5, 6, 11, 15] have been put forward for hypercomputers that could compute functions which are uncomputable on a Turing machine. The feasibility of building such devices remains in dispute =-=[7, 25, 33, 8]-=-. A related question concerns the time complexity of computable functions. Many models of computation are mathematical state machines that are provably equivalent to a Turing Machine, but some physica... |

19 | Three counterexamples refuting Kieu’s plan for quantum adiabatic hypercomputation and some uncomputable quantum mechanical tasks
- Smith
- 2006
(Show Context)
Citation Context ... proposals [5, 6, 11, 15] have been put forward for hypercomputers that could compute functions which are uncomputable on a Turing machine. The feasibility of building such devices remains in dispute =-=[7, 25, 33, 8]-=-. A related question concerns the time complexity of computable functions. Many models of computation are mathematical state machines that are provably equivalent to a Turing Machine, but some physica... |

17 | A Clause-Based Heuristic for SAT Solvers
- Dershowitz, Hanna, et al.
- 2005
(Show Context)
Citation Context ...gs are improved by making local changes. Solvers such as WalkSat [21] (and its predecessor GSAT) have features that are similar to Tabu search. Heuristics for optimisation strategies are discussed in =-=[9]-=-, and runtime distributions of SAT solvers are reviewed in [16]. The algorithms for WalkSat and GSAT are shown below: procedure WalkSat input f: array[1..c] of clauses {in CNF} output v:array[1..n] of... |

17 | Using Reconfigurable Computing Techniques to Accelerate
- Zhong, Martonosi, et al.
- 1998
(Show Context)
Citation Context ... accelerate satisfiability algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] =-=[38]-=- [27] [1] [39] [2] [26] [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the c... |

13 | A SAT solver using reconfigurable hardware and virtual logic
- Abramovici, Sousa
- 2000
(Show Context)
Citation Context ...ability algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] =-=[2]-=- [26] [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses re... |

13 | Using configurable computing to accelerate Boolean satisfiability
- Zhong, Martonosi, et al.
- 1999
(Show Context)
Citation Context ...tisfiability algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] =-=[39]-=- [2] [26] [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it use... |

12 | Acceleration of Satisfiability Algorithms by Reconfigurable Hardware
- Platzner, Micheli
(Show Context)
Citation Context ...lerate satisfiability algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] =-=[27]-=- [1] [39] [2] [26] [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circui... |

9 |
On the Threshold
- Hayes
(Show Context)
Citation Context ...ve. Previous research has shown that the set of SAT problems has an interesting structure, with a phase change from a subset of problems with few solutions to a subset of problems with many solutions =-=[19, 18, 37]-=-. The instances of SAT that are hard lie mostly near the phase change. This previous research is experimental: large sets of problem instances are generated randomly and their solution times measured.... |

9 | Reconfigurable accelerators for combinatorial problems
- Platzner
(Show Context)
Citation Context ...ity algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] [2] =-=[26]-=- [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses relaxat... |

7 |
Gelatt Jr and M.P. Vecchi, Optimization by simulated annealing
- Kirkpatrick, D
(Show Context)
Citation Context ... In addition to the generic circuit, we describe a simple polynomial time method for compiling an arbitrary SAT instance instance to run on the circuit. The approach is similar to simulated annealing =-=[22]-=- with a local potential energy function for each variable (Figure 1). The energy for the 0 or 1 states of a variable will be a function of the number of unsatisfied Boolean terms in which the variable... |

6 | The church–turing thesis: Consensus and opposition
- Davis
- 2006
(Show Context)
Citation Context ... proposals [5, 6, 11, 15] have been put forward for hypercomputers that could compute functions which are uncomputable on a Turing machine. The feasibility of building such devices remains in dispute =-=[7, 25, 33, 8]-=-. A related question concerns the time complexity of computable functions. Many models of computation are mathematical state machines that are provably equivalent to a Turing Machine, but some physica... |

5 |
Can’t Get No Satisfaction, American Scientist 85
- Hayes
- 1998
(Show Context)
Citation Context ...ve. Previous research has shown that the set of SAT problems has an interesting structure, with a phase change from a subset of problems with few solutions to a subset of problems with many solutions =-=[19, 18, 37]-=-. The instances of SAT that are hard lie mostly near the phase change. This previous research is experimental: large sets of problem instances are generated randomly and their solution times measured.... |

2 | A virtual logic algorithm for solving satisfiability problems using reconfigurable hardware
- Abramovici, Sousa
- 1999
(Show Context)
Citation Context ...e satisfiability algorithms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] =-=[1]-=- [39] [2] [26] [31] [28] [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; i... |

2 | Constraints on hypercomputation, in
- Michaelson, Cockshott
- 2006
(Show Context)
Citation Context |

2 |
J.T.: On Implementing a Configware/Software SAT Solver
- Reis, Sousa
- 2002
(Show Context)
Citation Context ...thms. Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] [2] [26] [31] =-=[28]-=- [35] [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses relaxation rather... |

1 |
Solving np-complete problems in hardware
- Koltes
- 2007
(Show Context)
Citation Context ...ly (the pseudo-algorithm shown above is synchronous). An asynchronous circuit may be faster, and it may find a solution more quickly. 5. EXPERIMENTAL RESULTS We have completed a successful simulation =-=[23]-=- of the hardware SAT solver using FPGA technology (with an Altera Cyclone chip) . An FPGA is a two-dimensional array of programmable components, which are connected by a programmable interconnection n... |

1 |
Fpga based accelerator for 3-sat conflict analysis in sat solvers
- Safar, El-Kharashi, et al.
- 2005
(Show Context)
Citation Context ... of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] [2] [26] [31] [28] [35] =-=[29]-=- [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses relaxation rather than an a... |

1 |
Interactive presentation: A shift register based clause evaluator for reconfigurable sat solver
- Safar, Shalan, et al.
- 2007
(Show Context)
Citation Context ...projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] [2] [26] [31] [28] [35] [29] [40] =-=[30]-=-. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses relaxation rather than an algorithmic... |

1 | Solving sat with a contextswitching virtual clause pipeline and an fpga embedded processor
- Tavares, Bungardean, et al.
- 2004
(Show Context)
Citation Context ... Many of these projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] [2] [26] [31] [28] =-=[35]-=- [29] [40] [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses relaxation rather than... |

1 |
Claudionor José Nunes Coelho Jr. A fast sat solver strategy based on negated clauses
- Zuim, Sousa
- 2006
(Show Context)
Citation Context ...hese projects use FPGAs to accelerate components of the Davis-Putnam algorithm. Skliarova and Ferrari give a survey [32]; specific projects include [3] [38] [27] [1] [39] [2] [26] [31] [28] [35] [29] =-=[40]-=- [30]. Our approach differs from previous work in several key respects. It has an efficient polynomial time compilation of a problem instance onto the circuit; it uses relaxation rather than an algori... |