On the public citation graph

An Efficient Hardware Implementation of a SAT Problem Solver on FPGA

0 signed · 33 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-61551-2_96openalex-snapshot
Solving satisfiability problems using field programmable gate arrays: First results
inferredcites →https://doi.org/10.1007/978-1-4757-3023-4_7openalex-snapshot
Algorithms for the Satisfiability (SAT) Problem
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_33openalex-snapshot
Understanding Random SAT: Beyond the Clauses-to-Variables Ratio
inferredcites →https://doi.org/10.1007/978-3-642-21581-0_27openalex-snapshot
Empirical Study of the Anatomy of Modern Sat Solvers
inferredcites →https://doi.org/10.1049/ip-cdt:20000482openalex-snapshot
FPGA-based SAT solver architecture with near-zero synthesis and layout overhead
inferredcites →https://doi.org/10.1090/dimacs/035/02openalex-snapshot
Algorithms for the satisfiability (SAT) problem: A survey
inferredcites →https://doi.org/10.1109/92.920826openalex-snapshot
Solving satisfiability problems using reconfigurable computing
inferredcites →https://doi.org/10.1109/dac.1998.724465openalex-snapshot
Using reconfigurable computing techniques to accelerate problems in the CAD domain: a case study with Boolean satisfiability
inferredcites →https://doi.org/10.1109/date.2007.364583openalex-snapshot
A Shift Register based Clause Evaluator for Reconfigurable SAT Solver
inferredcites →https://doi.org/10.1109/date.2011.5763199openalex-snapshot
A reconfigurable, pipelined, conflict directed jumping search SAT solver
inferredcites →https://doi.org/10.1109/fpga.1998.707896openalex-snapshot
Accelerating Boolean satisfiability with configurable hardware
inferredcites →https://doi.org/10.1109/tc.2004.102openalex-snapshot
Reconfigurable hardware SAT solvers: a survey of systems
inferredcites →https://doi.org/10.1109/tvlsi.2004.825859openalex-snapshot
A software/reconfigurable hardware SAT solver
inferredcites →https://doi.org/10.1145/1497561.1497576openalex-snapshot
FPGA-based hardware acceleration for Boolean satisfiability
inferredcites →https://doi.org/10.1145/1857927.1857937openalex-snapshot
An Approach for Solving Large SAT Problems on FPGA
inferredcites →https://doi.org/10.1145/277044.277098openalex-snapshot
Using reconfigurable computing techniques to accelerate problems in the CAD domain
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
inferredcites →https://doi.org/10.1609/aimag.v33i1.2395openalex-snapshot
The International SAT Solver Competitions

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s10462-018-9628-0openalex-snapshot
A comprehensive study and analysis on SAT-solvers: advances, usages and achievements
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.014openalex-snapshot
Hardware accelerated SAT solvers—A survey
inferred← citeshttps://doi.org/10.1049/cje.2021.08.001openalex-snapshot
An Parallel FPGA SAT Solver Based on Multi‐Thread and Pipeline
inferred← citeshttps://doi.org/10.1109/aemcse51986.2021.00234openalex-snapshot
A Framework of SAT Solver Based on the ZYNQ
inferred← citeshttps://doi.org/10.1109/dsd.2019.00021openalex-snapshot
SAT-Hard: A Learning-Based Hardware SAT-Solver
inferred← citeshttps://doi.org/10.1109/fpga4gpc.2017.8008962openalex-snapshot
An FPGA SAT solver based on enhanced constraint
inferred← citeshttps://doi.org/10.1109/hpca68181.2026.11408459openalex-snapshot
A PN-Free Digital 3-SAT Accelerator Using Crossbar Architecture and Frequency-Controlled Counters
inferred← citeshttps://doi.org/10.1109/icam.2016.7813618openalex-snapshot
A FPGA based SAT solver with random variable selection
inferred← citeshttps://doi.org/10.1109/qrs-c.2018.00049openalex-snapshot
A FPGA Based SAT Solver with High Random and Concurrent Strategies
inferred← citeshttps://doi.org/10.1145/3194554.3194643openalex-snapshot
SAT-Lancer
inferred← citeshttps://doi.org/10.1145/3649476.3658808openalex-snapshot
Accelerating Boolean Constraint Propagation for Efficient SAT-Solving on FPGAs
inferred← citeshttps://doi.org/10.1587/transinf.2016edp7487openalex-snapshot
An Approach for Solving SAT/MaxSAT-Encoded Formal Verification Problems on FPGA
inferred← citeshttps://doi.org/10.22215/etd/2024-16034openalex-snapshot
Hardware-Accelerated SAT Solvers
inferred← citeshttps://doi.org/10.23919/date.2019.8714967openalex-snapshot
Better Late Than Never : Verification of Embedded Systems After Deployment
inferred← citeshttps://doi.org/10.3390/electronics8030333openalex-snapshot
An Effective FPGA Solver on Probability Distribution and Preprocessing
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.