The following pages link to Victor Lagerkvist (Q340557):
Displaying 22 items.
- Strong partial clones and the time complexity of SAT problems (Q340559) (← links)
- An initial study of time complexity in infinite-domain constraint satisfaction (Q514144) (← links)
- Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem (Q2221799) (← links)
- Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592) (← links)
- Constructing NP-intermediate problems by blowing holes with parameters of various properties (Q2345449) (← links)
- Weak bases of Boolean co-clones (Q2448853) (← links)
- General lower bounds and improved algorithms for infinite-domain CSPs (Q2700386) (← links)
- Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem (Q2946352) (← links)
- The power of primitive positive definitions with polynomially many variables (Q3133171) (← links)
- A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT (Q4608627) (← links)
- (Q5005145) (← links)
- Sparsification of SAT and CSP Problems via Tractable Extensions (Q5053064) (← links)
- Fine-Grained Time Complexity of Constraint Satisfaction Problems (Q5061878) (← links)
- (Q5092397) (← links)
- Time Complexity of Constraint Satisfaction via Universal Algebra (Q5111231) (← links)
- A Dichotomy Theorem for the Inverse Satisfiability Problem (Q5136331) (← links)
- Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis (Q5741801) (← links)
- (Q5863854) (← links)
- (Q5863863) (← links)
- The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems (Q5868883) (← links)
- Computational Short Cuts in Infinite Domain Constraint Satisfaction (Q5870497) (← links)
- On the Strength of Uniqueness Quantification in Primitive Positive Formulas (Q6320624) (← links)
