Digital design principles and practices
Digital design principles and practices
DAC '98 Proceedings of the 35th annual Design Automation Conference
Minds and Machines
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
Journal of Automated Reasoning
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Satisfiability on reconfigurable hardware
FPL '97 Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications
Acceleration of Satisfiability Algorithms by Reconfigurable Hardware
FPL '98 Proceedings of the 8th International Workshop on Field-Programmable Logic and Applications, From FPGAs to Computing Paradigm
A Virtual Logic Algorithm for Solving Satisfiability Problems Using Reconfigurable Hardware
FCCM '99 Proceedings of the Seventh Annual IEEE Symposium on Field-Programmable Custom Computing Machines
On Implementing a Configware/Software SAT Solver
FCCM '02 Proceedings of the 10th Annual IEEE Symposium on Field-Programmable Custom Computing Machines
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Design and Implementation of Reconfigurable Processor for Problems of Combinatorial Computations
DSD '01 Proceedings of the Euromicro Symposium on Digital Systems Design
Reconfigurable Hardware SAT Solvers: A Survey of Systems
IEEE Transactions on Computers
Interactive presentation: A shift register based clause evaluator for reconfigurable SAT solver
Proceedings of the conference on Design, automation and test in Europe
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Turing machines, transition systems, and interaction
Information and Computation
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
The church-turing thesis: consensus and opposition
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Constraints on hypercomputation
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Zchaff2004: an efficient SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
FPGA based accelerator for 3-SAT conflict analysis in SAT solvers
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
Using configurable computing to accelerate Boolean satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Non-classical computing: feasible versus infeasible
Proceedings of the 2010 ACM-BCS Visions of Computer Science Conference
| Hi-index | 0.00 |
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.