On the public citation graph
Enhanced Gaussian Elimination in DPLL-based SAT Solvers
0 signed · 43 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11499107_5openalex-snapshot
Effective Preprocessing in SAT Through Variable and Clause Elimination
inferredcites →https://doi.org/10.1007/11527695_12openalex-snapshot
Aligning CNF- and Equivalence-Reasoning
inferredcites →https://doi.org/10.1007/978-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-77272-9_10openalex-snapshot
Algebraic Cryptanalysis of the Data Encryption Standard
inferredcites →https://doi.org/10.1007/978-3-642-02777-2_24openalex-snapshot
Extending SAT Solvers to Cryptographic Problems
inferredcites →https://doi.org/10.1016/s0166-218x(02)00407-9openalex-snapshot
Equivalent literal propagation in the DLL procedure
inferredcites →https://doi.org/10.1016/s0167-6377(98)00052-2openalex-snapshot
A two-phase algorithm for solving a class of hard satisfiability problems
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-snapshot
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1137/0613024openalex-snapshot
Sparse Matrices in MATLAB: Design and Implementation
inferredcites →https://doi.org/10.48550/arxiv.cs/0703006openalex-snapshot
XORSAT: An Efficient Algorithm for the DIMACS 32-bit Parity Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-51825-7_1openalex-snapshot
Sorting Parity Encodings by Reusing Variables
inferred← citeshttps://doi.org/10.1007/978-3-030-51938-4_11openalex-snapshot
A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-58475-7_16openalex-snapshot
A Time Leap Challenge for SAT-Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-03077-7_22openalex-snapshot
Arithmetic Bit-Level Verification Using Network Flow Model
inferred← citeshttps://doi.org/10.1007/978-3-319-43174-1_6openalex-snapshot
Improvements to the Equivalence Checking of Reversible Circuits
inferred← citeshttps://doi.org/10.1007/978-3-319-48758-8_27openalex-snapshot
DRAT Proofs for XOR Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_11openalex-snapshot
On Tackling the Limits of Resolution in SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-94144-8_26openalex-snapshot
PySAT: A Python Toolkit for Prototyping with SAT Oracles
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_31openalex-snapshot
When Boolean Satisfiability Meets Gaussian Elimination in a Simplex Way
inferred← citeshttps://doi.org/10.1007/978-3-642-31612-8_29openalex-snapshot
Conflict-Driven XOR-Clause Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_28openalex-snapshot
Classifying and Propagating Parity Constraints
inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_38openalex-snapshot
Simulating Parity Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-662-46681-0_26openalex-snapshot
Approximate Counting in SMT and Value Estimation for Probabilistic Programs
inferred← citeshttps://doi.org/10.1007/s00236-017-0297-2openalex-snapshot
Approximate counting in SMT and value estimation for probabilistic programs
inferred← citeshttps://doi.org/10.1007/s10618-017-0501-6openalex-snapshot
Flexible constrained sampling with guarantees for pattern mining
inferred← citeshttps://doi.org/10.1007/s11128-025-04948-7openalex-snapshot
SAT, gadgets, Max2XOR, and quantum annealers
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103552openalex-snapshot
Propositional proof systems based on maximum satisfiability
inferred← citeshttps://doi.org/10.1109/ictai.2011.103openalex-snapshot
Equivalence Class Based Parity Reasoning with DPLL(XOR)
inferred← citeshttps://doi.org/10.1109/ictai.2012.18openalex-snapshot
Extending Clause Learning SAT Solvers with Complete Parity Reasoning
inferred← citeshttps://doi.org/10.1109/isvlsi.2014.43openalex-snapshot
Function Extraction from Arithmetic Bit-Level Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2016.2547898openalex-snapshot
Formal Verification of Arithmetic Circuits by Function Extraction
inferred← citeshttps://doi.org/10.1109/tcad.2018.2808457openalex-snapshot
Formal Analysis of Galois Field Arithmetic Circuits-Parallel Verification and Reverse Engineering
inferred← citeshttps://doi.org/10.1145/2744769.2744925openalex-snapshot
Verification of gate-level arithmetic circuits by function extraction
inferred← citeshttps://doi.org/10.29007/7jgqopenalex-snapshot
Towards a Semantics of Unsatisfiability Proofs with Inprocessing
inferred← citeshttps://doi.org/10.31274/etd-180810-2105openalex-snapshot
Efficient satisfiability solver
inferred← citeshttps://doi.org/10.3850/9783981537079_0152openalex-snapshot
Exploiting Inherent Characteristics of Reversible Circuits for Faster Combinational Equivalence Checking
inferred← citeshttps://doi.org/10.48550/arxiv.1407.6571openalex-snapshot
Conflict-Driven XOR-Clause Learning (extended version)
inferred← citeshttps://doi.org/10.48550/arxiv.1808.02821openalex-snapshot
Positive 1-in-3-SAT admits a non-trivial Kernel
inferred← citeshttps://doi.org/10.48550/arxiv.2009.04274openalex-snapshot
Where's Crypto?: Automated Identification and Classification of Proprietary Cryptographic Primitives in Binary Code
inferred← citeshttps://doi.org/10.70675/ac44098cz09bez449fza5baz2141f466bb48openalex-snapshot
Exploitation de la logique propositionnelle pour la résolution parallèle des problèmes cryptographiques
inferred← citeshttps://doi.org/10.70675/ef2412acz2c06z4b2dzbcdcz11c3bbb0c27aopenalex-snapshot
Exploitation of dynamic symmetries for solving SAT problems
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.