Victor Lagerkvist

Available identifiers

zbMath Open lagerkvist.victorMaRDI QIDQ340557

List of research outcomes

Publication	Date of Publication	Type
General lower bounds and improved algorithms for infinite-domain CSPs	2023-04-21	Paper
Computational Short Cuts in Infinite Domain Constraint Satisfaction	2023-01-09	Paper
Sparsification of SAT and CSP Problems via Tractable Extensions	2022-12-05	Paper
The (Coarse) Fine-Grained Structure of NP-Hard SAT and CSP Problems	2022-09-24	Paper
https://portal.mardi4nfdi.de/entity/Q5092397	2022-07-21	Paper
https://portal.mardi4nfdi.de/entity/Q5863863	2022-06-03	Paper
https://portal.mardi4nfdi.de/entity/Q5863854	2022-06-03	Paper
Fine-Grained Time Complexity of Constraint Satisfaction Problems	2022-03-14	Paper
Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms	2021-11-02	Paper
https://portal.mardi4nfdi.de/entity/Q5005145	2021-08-04	Paper
Complexity of inverse constraint problems and a dichotomy for the inverse satisfiability problem	2021-02-02	Paper
A Dichotomy Theorem for the Inverse Satisfiability Problem	2020-11-25	Paper
Time Complexity of Constraint Satisfaction via Universal Algebra	2020-05-26	Paper
On the Strength of Uniqueness Quantification in Primitive Positive Formulas	2019-06-17	Paper
Complexity of SAT Problems, Clone Theory and the Exponential Time Hypothesis	2019-05-15	Paper
A Preliminary Investigation of Satisfiability Problems Not Harder than 1-in-3-SAT	2018-03-21	Paper
The power of primitive positive definitions with polynomially many variables	2018-02-13	Paper
An initial study of time complexity in infinite-domain constraint satisfaction	2017-02-28	Paper
Strong partial clones and the time complexity of SAT problems	2016-11-14	Paper
Precise Upper and Lower Bounds for the Monotone Constraint Satisfaction Problem	2015-09-16	Paper
Constructing NP-intermediate problems by blowing holes with parameters of various properties	2015-05-22	Paper
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis	2014-10-14	Paper
Weak bases of Boolean co-clones	2014-05-05	Paper
The Fine-Grained Complexity of Graph Homomorphism Problems: Towards the Okrasa and Rz\k{a}\.zewski Conjecture	N/A	Paper

Research outcomes over time

This page was built for person: Victor Lagerkvist