On the public citation graph

Acceleration of satisfiability algorithms by reconfigurable hardware

0 signed · 45 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-61730-2_14openalex-snapshot
Solving satisfiability problems on FPGAs
inferredcites →https://doi.org/10.1007/3-540-63465-7_250openalex-snapshot
Satisfiability on reconfigurable hardware
inferredcites →https://doi.org/10.1090/dimacs/035/02openalex-snapshot
Algorithms for the satisfiability (SAT) problem: A survey
inferredcites →https://doi.org/10.1109/fpga.1998.707896openalex-snapshot
Accelerating Boolean satisfiability with configurable hardware
inferredcites →https://doi.org/10.1109/fpga.1998.707897openalex-snapshot
Dynamic circuit generation for solving specific problem instances of Boolean satisfiability
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-44687-7_33openalex-snapshot
Run-Time Performance Optimization of an FPGA-Based Deduction Engine for SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-1-4419-0944-2_5openalex-snapshot
Accelerating Boolean Satisfiability on an FPGA
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_36openalex-snapshot
Solving SAT with a Context-Switching Virtual Clause Pipeline and an FPGA Embedded Processor
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_53openalex-snapshot
An Instance-Specific Hardware Algorithm for Finding a Maximum Clique
inferred← citeshttps://doi.org/10.1007/978-3-540-45234-8_46openalex-snapshot
Reconfigurable Hardware SAT Solvers: A Survey of Systems
inferred← citeshttps://doi.org/10.1016/j.cl.2009.09.001openalex-snapshot
An investigation in parallel execution of answer set programs on distributed memory platforms: Task sharing and dynamic scheduling
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.014openalex-snapshot
Hardware accelerated SAT solvers—A survey
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00067-5openalex-snapshot
The design and implementation of a reconfigurable processor for problems of combinatorial computation
inferred← citeshttps://doi.org/10.1023/a:1006310219368openalex-snapshot
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
inferred← citeshttps://doi.org/10.1023/a:1024443416592openalex-snapshot
Instance-Specific Accelerators for Minimum Covering
inferred← citeshttps://doi.org/10.1063/1.4981999openalex-snapshot
A survey of SAT solver
inferred← citeshttps://doi.org/10.1109/2.839322openalex-snapshot
Reconfigurable accelerators for combinatorial problems
inferred← citeshttps://doi.org/10.1109/43.766733openalex-snapshot
Using configurable computing to accelerate Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/92.920835openalex-snapshot
Object-oriented domain specific compilers for programming FPGAs
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493521openalex-snapshot
Hardware based algorithm for conflict diagnosis in SAT solver
inferred← citeshttps://doi.org/10.1109/ccece.2006.277452openalex-snapshot
FPGA-Based SAT Solver
inferred← citeshttps://doi.org/10.1109/dac.1999.782036openalex-snapshot
A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/date.2007.364583openalex-snapshot
A Shift Register based Clause Evaluator for Reconfigurable SAT Solver
inferred← citeshttps://doi.org/10.1109/dsd.2001.952250openalex-snapshot
Design and implementation of reconfigurable processor for problems of combinatorial computations
inferred← citeshttps://doi.org/10.1109/fccm.2001.3openalex-snapshot
A Configurable Hardware/Software Approach to SAT Solving
inferred← citeshttps://doi.org/10.1109/fpga.1999.803708openalex-snapshot
A virtual logic algorithm for solving satisfiability problems using reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/hicss.1999.772883openalex-snapshot
Dynamic circuit generation for Boolean satisfiability in an object-oriented design environment
inferred← citeshttps://doi.org/10.1109/icces.2006.320437openalex-snapshot
A Hardware Accelerator for SAT Solving
inferred← citeshttps://doi.org/10.1109/idt.2010.5724417openalex-snapshot
A novel conflict directed jumping algorithm for hardware-based SAT solvers
inferred← citeshttps://doi.org/10.1109/ipdpsw.2012.57openalex-snapshot
SMPP: Generic SAT Solver over Reconfigurable Hardware Accelerator
inferred← citeshttps://doi.org/10.1109/iwsoc.2005.40openalex-snapshot
An FPGA based accelerator for SAT based combinational equivalence checking
inferred← citeshttps://doi.org/10.1109/mtv.2009.25openalex-snapshot
A Reconfigurable Five-Stage Pipelined SAT Solver
inferred← citeshttps://doi.org/10.1109/mwscas.2004.1354047openalex-snapshot
Implementations of a hardware n choose k counter
inferred← citeshttps://doi.org/10.1109/tc.2004.102openalex-snapshot
Reconfigurable hardware SAT solvers: a survey of systems
inferred← citeshttps://doi.org/10.1109/tvlsi.2004.825859openalex-snapshot
A software/reconfigurable hardware SAT solver
inferred← citeshttps://doi.org/10.1145/1497561.1497576openalex-snapshot
FPGA-based hardware acceleration for Boolean satisfiability
inferred← citeshttps://doi.org/10.1145/309847.310028openalex-snapshot
A massively-parallel easily-scalable satisfiability solver using reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/605440.605444openalex-snapshot
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.8openalex-snapshot
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
inferred← citeshttps://doi.org/10.1587/transcom.e92.b.3102openalex-snapshot
Resource Minimization Method Satisfying Delay Constraint for Replicating Large Contents
inferred← citeshttps://doi.org/10.5555/1266366.1266400openalex-snapshot
Interactive presentation: A shift register based clause evaluator for reconfigurable SAT solver
inferred← citeshttps://doi.org/10.5555/1998496.1998536openalex-snapshot
Relieving capacity limits on FPGA-based SAT-solvers
inferred← citeshttps://doi.org/10.70675/f3f1f0dbz62f0z44e7z9bedz608c7d549267openalex-snapshot
Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.