A Hardware Relaxation Paradigm for Solving NP-Hard Problems

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.

[1]  M. Watheq El-Kharashi,et al.  A Shift Register based Clause Evaluator for Reconfigurable SAT Solver , 2007, 2007 Design, Automation & Test in Europe Conference & Exhibition.

[2]  Martin D. Davis,et al.  The Church-Turing Thesis: Consensus and Opposition , 2006, CiE.

[3]  Peggy Aldrich Kidwell.  Colossus: The Secrets of Bletchley Park's Codebreaking Computers (review) , 2007 .

[4]  José T. de Sousa,et al.  On implementing a configware/software SAT solver , 2002, Proceedings. 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines.

[5]  Peter C. Cheeseman,et al.  Where the Really Hard Problems Are , 1991, IJCAI.

[6]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[7]  Eugene Goldberg,et al.  BerkMin: A Fast and Robust Sat-Solver , 2002 .

[8]  Nachum Dershowitz,et al.  A Clause-Based Heuristic for SAT Solvers , 2005, SAT.

[9]  Sharad Malik,et al.  Using configurable computing to accelerate Boolean satisfiability , 1999, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[10]  Iouliia Skliarova,et al.  Reconfigurable Hardware SAT Solvers: A Survey of Systems , 2003, FPL.

[11]  B. Jack Copeland,et al.  Hypercomputation , 2004, Minds and Machines.

[12]  Brian Hayes,et al.  CAN’T GET NO SATISFACTION , 1997 .

[13]  Warren D. Smith.  Three counterexamples refuting Kieu's plan for "quantum adiabatic hypercomputation"; and some uncomputable quantum mechanical tasks , 2006, Appl. Math. Comput..

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  José T. de Sousa,et al.  A Fast SAT Solver Strategy Based on Negated Clauses , 2006, 2006 IFIP International Conference on Very Large Scale Integration.

[16]  José T. de Sousa,et al.  Solving SAT with a Context-Switching Virtual Clause Pipeline and an FPGA Embedded Processor , 2004, FPL.

[17]  Marco Platzner,et al.  Acceleration of Satisfiability Algorithms by Reconfigurable Hardware , 1998, FPL.

[18]  Marco Platzner.  Reconfigurable Accelerators for Combinatorial Problems , 2000, Computer.

[19]  Daniel G. Saab,et al.  Satisfiability on reconfigurable hardware , 1997, FPL.

[20]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[21]  Niklas Sörensson,et al.  Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[22]  Paolo Cotogno,et al.  Hypercomputation and the Physical Church‐Turing Thesis , 2003, The British Journal for the Philosophy of Science.

[23]  Niklas Een,et al.  MiniSat v1.13 - A SAT Solver with Conflict-Clause Minimization , 2005 .

[24]  Scott A. Smolka,et al.  Turing machines, transition systems, and interaction , 2004, Inf. Comput..

[25]  István Németi,et al.  Non-Turing Computations Via Malament–Hogarth Space-Times , 2001 .

[26]  José T. de Sousa,et al.  A SAT Solver Using Reconfigurable Hardware and Virtual Logic , 2000, Journal of Automated Reasoning.

[27]  Stuart A. Kauffman,et al.  ORIGINS OF ORDER , 2019, Origins of Order.

[28]  John F. Wakerly,et al.  Digital design - principles and practices , 1990, Prentice Hall Series in computer engineering.

[29]  Iouliia Skliarova,et al.  Design and implementation of reconfigurable processor for problems of combinatorial computations , 2001, Proceedings Euromicro Symposium on Digital Systems Design.

[30]  W. Paul Cockshott,et al.  Constraints on Hypercomputation , 2006, CiE.

[31]  Bart Selman,et al.  Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems , 2000, Journal of Automated Reasoning.

[32]  B. Copeland,et al.  Beyond the universal Turing machine , 1999 .

[33]  M. Watheq El-Kharashi,et al.  FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers , 2005, CHARME.

[34]  Brian Hayes,et al.  On the Threshold , 2003, American Scientist.

[35]  Toby Walsh,et al.  The Constrainedness of Search , 1996, AAAI/IAAI, Vol. 1.

[36]  José T. de Sousa,et al.  A virtual logic algorithm for solving satisfiability problems using reconfigurable hardware , 1999, Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines (Cat. No.PR00375).

[37]  Sharad Malik,et al.  Zchaff2004: An Efficient SAT Solver , 2004, SAT (Selected Papers.

[38]  A. Hajimiri,et al.  Jitter and phase noise in ring oscillators , 1999, IEEE J. Solid State Circuits.

[39]  Benedikt Löwe,et al.  Logical Approaches to Computational Barriers: CiE 2006 , 2007, J. Log. Comput..