The following pages link to Jakob Nordström (Q989568):
Displaying 47 items.
- A simplified way of proving trade-off results for resolution (Q989569) (← links)
- Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers (Q1656563) (← links)
- In between resolution and cutting planes: a study of proof systems for pseudo-Boolean SAT solving (Q1656587) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q2040600) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Simplified and improved separations between regular and general resolution by lifting (Q2661346) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- Pebble Games, Proof Complexity, and Time-Space Trade-offs (Q2848360) (← links)
- Narrow proofs may be spacious (Q2931413) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- On the Relative Strength of Pebbling and Resolution (Q2946664) (← links)
- From small space to small width in resolution (Q2965493) (← links)
- On Minimal Unsatisfiability and Time-Space Trade-offs for k-DNF Resolution (Q3012839) (← links)
- (Q3191584) (← links)
- A (Biased) Proof Complexity Survey for SAT Practitioners (Q3192050) (← links)
- Long Proofs of (Seemingly) Simple Formulas (Q3192059) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q4598196) (← links)
- (Q4601842) (← links)
- A Generalized Method for Proving Polynomial Calculus Degree Lower Bounds (Q4601843) (← links)
- Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler--Leman Refinement Steps (Q4635882) (← links)
- Cumulative Space in Black-White Pebbling and Resolution (Q4638091) (← links)
- Clique Is Hard on Average for Regular Resolution (Q5056413) (← links)
- Nullstellensatz size-degree trade-offs from reversible pebbling (Q5091769) (← links)
- (Q5111132) (← links)
- Narrow Proofs May Be Spacious:Separating Space and Width in Resolution (Q5189540) (← links)
- Supercritical Space-Width Trade-offs for Resolution (Q5215515) (← links)
- Clique is hard on average for regular resolution (Q5230344) (← links)
- From Small Space to Small Width in Resolution (Q5277893) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- (Q5302095) (← links)
- Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (Q5326581) (← links)
- On the virtue of succinct proofs (Q5415478) (← links)
- Some trade-off results for polynomial calculus (Q5495852) (← links)
- Exponential Resolution Lower Bounds for Weak Pigeonhole Principle and Perfect Matching Formulas over Sparse Graphs (Q6330219) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs (Q6517784) (← links)
- KRW composition theorems via lifting (Q6542432) (← links)
- Certified CNF translations for pseudo-Boolean solving (Q6572029) (← links)
- Using Resolution Proofs to Analyse CDCL SAT solvers (Q6700388) (← links)
- Composed Pebbling PHP pyramid instances in OPB format (Q6711274) (← links)
- Experimental Repository for "Learn to Relax: Integrating 0-1 Integer Linear Programming with Pseudo-Boolean Conflict-Driven Search" (Q6711276) (← links)
- Experimental Repository for "Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning" (Q6711279) (← links)
- Experimental Repository for "Certified CNF Translations for Pseudo-Boolean Solving" (Q6711293) (← links)
- Experimental Repository for "Certified Core-Guided MaxSAT Solving" (Q6711300) (← links)
- Experimental Repository for "Certifying Without Loss of Generality Reasoning in Solution-Improving Maximum Satisfiability" (Q6711302) (← links)
- Cut-based Conflict Analysis in Mixed Integer Programming (Q6749553) (← links)
