The following pages link to Marijn J. H. Heule (Q352966):
Displayed 50 items.
- Simulating circuit-level simplifications on CNF (Q352967) (← links)
- Symmetry in Gardens of Eden (Q396822) (← links)
- (Q870056) (redirect page) (← links)
- A new method to construct lower bounds for van der Waerden numbers (Q870059) (← links)
- Sums of squares based approximation algorithms for MAX-SAT (Q944728) (← links)
- A little blocked literal goes a long way (Q1680260) (← links)
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- Extended resolution simulates \({\mathsf{DRAT}}\) (Q1799112) (← links)
- Optimal symmetry breaking for graph problems (Q2009225) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Dual proof generation for quantified Boolean formulas with a BDD-based solver (Q2055876) (← links)
- An automated approach to the Collatz conjecture (Q2055879) (← links)
- SAT competition 2020 (Q2060693) (← links)
- Preprocessing of propagation redundant clauses (Q2104502) (← links)
- Chinese remainder encoding for Hamiltonian cycles (Q2118300) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- Local search for fast matrix multiplication (Q2181927) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML (Q2233509) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
- Computing properties of stable configurations of thermodynamic binding networks (Q2315010) (← links)
- What a difference a variable makes (Q2324225) (← links)
- Solution validation and extraction for QBF preprocessing (Q2362496) (← links)
- Solving games dependence of applicable solving procedures (Q2373871) (← links)
- Avoiding triples in arithmetic progression (Q2404820) (← links)
- Short proofs without new variables (Q2405245) (← links)
- Efficient certified RAT verification (Q2405252) (← links)
- Sorting parity encodings by reusing variables (Q2661327) (← links)
- Mycielski graphs and PR proofs (Q2661347) (← links)
- Tighter bounds on directed Ramsey number \(R(7)\) (Q2676760) (← links)
- Computing Maximum Unavoidable Subgraphs Using SAT Solvers (Q2818013) (← links)
- Solving and Verifying the Boolean Pythagorean Triples Problem via Cube-and-Conquer (Q2818017) (← links)
- Blocked Clause Decomposition (Q2870145) (← links)
- Inprocessing Rules (Q2908507) (← links)
- Clause Elimination for SAT and QSAT (Q2941732) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Efficient CNF Simplification Based on Binary Implication Graphs (Q3007684) (← links)
- MUS Extraction Using Clausal Proofs (Q3192054) (← links)
- Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask) (Q3192079) (← links)
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs (Q3192088) (← links)
- A Unified Proof System for QBF Preprocessing (Q3192183) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- Static Detection of DoS Vulnerabilities in Programs that Use Regular Expressions (Q3303917) (← links)
- (Q3429156) (← links)
- Expressing Symmetry Breaking in DRAT Proofs (Q3454124) (← links)
- Compositional Propositional Proofs (Q3460074) (← links)
- Blocked Clause Elimination (Q3557074) (← links)
- Exact DFA Identification Using SAT Solvers (Q3588365) (← links)
- (Q3604001) (← links)