Get started
Author

Victor Lagerkvist

Observed names: Lagerkvist, Victor, VICTOR LAGERKVIST
ORCID: 0000-0001-8144-4145
Observed ORCID: 0000-0001-8144-4145
OpenAlex ID: A5089123758
Strong partial clones and the time complexity of SAT problems
2016 · Peter Jonsson, Victor Lagerkvist, et al. · Journal of Computer and System Sciences · 32
PDF
Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications
2015 · Victor Lagerkvist · Linköping studies in science and technology. Dissertations · 24
PDF
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis
2013 · Peter Jonsson, Victor Lagerkvist, et al. · ACM-SIAM Symposium on Discrete Algorithms (SODA) · 22
Weak bases of Boolean co-clones
2014 · Victor Lagerkvist · Information Processing Letters · 20
PDF
Sparsification of SAT and CSP Problems via Tractable Extensions
2020 · Victor Lagerkvist, Magnus Wahlström · ACM Transactions on Computation Theory · 18
The Richness of CSP Non-redundancy
2025 · Brakensiek, Joshua, Guruswami, Venkatesan, et al. · arXiv (Cornell University) · 16
PDF
An initial study of time complexity in infinite-domain constraint satisfaction
2017 · Peter Jonsson, Victor Lagerkvist · Artificial Intelligence · 16
PDF
Kernelization of Constraint Satisfaction Problems: A Study Through Universal Algebra
2017 · Victor Lagerkvist, Magnus Wahlström · Lecture notes in computer science · 11
PDF
The power of primitive positive definitions with polynomially many variables
2016 · Victor Lagerkvist, Magnus Wahlström · Journal of Logic and Computation · 10
Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey
2019 · Miguel Couceiro, Lucien Haddad, et al. · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · 9
Which NP-Hard SAT and CSP Problems Admit Exponentially Improved Algorithms?
2018 · Lagerkvist, Victor, Wahlström, Magnus · arXiv (Cornell University) · 8
PDF
Acyclic orders, partition schemes and CSPs: Unified hardness proofs and improved algorithms
2021 · Peter Jonsson, Victor Lagerkvist, et al. · Artificial Intelligence · 7
PDF
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem
2020 · Victor Lagerkvist, Biman Roy · Journal of Computer and System Sciences · 6
Why are CSPs Based on Partition Schemes Computationally Hard?
2018 · Jonsson, Peter, Lagerkvist, Victor · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 6
PDF
Bounded Bases of Strong Partial Clones
2015 · Victor Lagerkvist, Magnus Wahlström, et al. · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · 6
Super-linear Lower Bounds for CSP Non-Redundancy via Shrinking Instances
2026 · Brakensiek, Joshua, Guruswami, Venkatesan, et al. · arXiv (Cornell University) · 5
PDF
Improved Algorithms for Allen's Interval Algebra: a Dynamic Programming Approach
2021 · Leif Eriksson, Victor Lagerkvist · International Joint Conference on Artificial Intelligence · 5
PDF
Time Complexity of Constraint Satisfaction via Universal Algebra
2017 · Jonsson, Peter, Lagerkvist, Victor, et al. · arXiv (Cornell University) · 5
PDF
A Multivariate Complexity Analysis of Qualitative Reasoning Problems
2022 · Leif Eriksson, Victor Lagerkvist · International Joint Conference on Artificial Intelligence · 4
PDF
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems
2021 · Victor Lagerkvist, Magnus Wahlström · ACM Transactions on Computation Theory · 4
Fine-Grained Time Complexity of Constraint Satisfaction Problems
2021 · Peter Jonsson, Victor Lagerkvist, et al. · ACM Transactions on Computation Theory · 4
A Dichotomy Theorem for the Inverse Satisfiability Problem
2018 · Lagerkvist, Victor, Roy, Biman · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 4
PDF
Constructing NP-intermediate problems by blowing holes with parameters of various properties
2015 · Peter Jonsson, Victor Lagerkvist, et al. · Theoretical Computer Science · 4
PDF
Polynomially Closed Co-clones
2014 · Victor Lagerkvist, Magnus Wahlstrom · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · 4
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis
2014 · Peter Jonsson, Victor Lagerkvist, et al. · Lecture notes in computer science · 4
PDF
Works count: 61
Citation count: 290
H-index: 9
I10-index: 9
Year
Topic
Type