2022 Victor Lagerkvist, Magnus Wahlstrom (2022) The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems ACM Transactions on Computation Theory , Vol. 14 Continue to DOI Victor Lagerkvist, Biman Roy (2022) C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases Journal of Multiple-Valued Logic and Soft Computing , Vol. 38 , s. 333-353 Miguel Couceiro, Lucien Haddad, Victor Lagerkvist (2022) A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms Journal of Multiple-Valued Logic and Soft Computing , Vol. 38 , s. 115-136 2021 Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman (2021) The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems Theoretical Computer Science , Vol. 892 Continue to DOI Peter Jonsson, Victor Lagerkvist, Biman Roy (2021) Fine-Grained Time Complexity of Constraint Satisfaction Problems ACM Transactions on Computation Theory , Vol. 13 Continue to DOI
Victor Lagerkvist, Magnus Wahlstrom (2022) The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems ACM Transactions on Computation Theory , Vol. 14 Continue to DOI
Victor Lagerkvist, Biman Roy (2022) C-Maximal Strong Partial Clones and the Inclusion Structure of Boolean Weak Bases Journal of Multiple-Valued Logic and Soft Computing , Vol. 38 , s. 333-353
Miguel Couceiro, Lucien Haddad, Victor Lagerkvist (2022) A Survey on the Fine-grained Complexity of Constraint Satisfaction Problems Based on Partial Polymorphisms Journal of Multiple-Valued Logic and Soft Computing , Vol. 38 , s. 115-136
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman (2021) The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems Theoretical Computer Science , Vol. 892 Continue to DOI
Peter Jonsson, Victor Lagerkvist, Biman Roy (2021) Fine-Grained Time Complexity of Constraint Satisfaction Problems ACM Transactions on Computation Theory , Vol. 13 Continue to DOI
It's exciting when I manage to prove that something is true "Doing research is a bit like solving a jigsaw puzzle", says Victor Lagerkvist. He received his PhD in theoretical computer science in 2016.